-
1Academic Journal
المؤلفون: Censor-Hillel, Keren, Huberman, Einav
مصطلحات موضوعية: Labeling schemes, Erasures, Theory of computation → Distributed algorithms, Mathematics of computing → Graph algorithms
وصف الملف: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.OPODIS.2024; https://dx.doi.org/10.1145/2213977.2214084; https://dx.doi.org/10.1145/564870.564914; https://dx.doi.org/10.1016/J.IC.2022.104925; https://dx.doi.org/10.1145/3519935.3520027; https://dx.doi.org/10.1016/J.TCS.2022.03.020; https://dx.doi.org/10.1145/2767386.2767421; https://dx.doi.org/10.1137/1.9781611977073.97; https://dx.doi.org/10.1016/J.TCS.2018.08.020; https://dx.doi.org/10.1145/3465084.3467929; https://dx.doi.org/10.4230/LIPICS.DISC.2020.20; https://dx.doi.org/10.4230/LIPIcs.DISC.2022.20; https://dx.doi.org/10.1137/1.9781611977554.CH168; https://dx.doi.org/10.46298/DMTCS.6280; https://dx.doi.org/10.1016/J.JPDC.2022.04.015; https://dx.doi.org/10.1007/S00446-020-00386-Z; https://dx.doi.org/10.4230/LIPIcs.OPODIS.2021.21; https://dx.doi.org/10.1007/S00446-008-0076-Y
-
2Conference
المؤلفون: Beaudou, Laurent, Bergé, Pierre, Chernyshev, Vsevolod, Dailly, Antoine, Gerard, Yan, Lagoutte, Aurélie, Limouzy, Vincent, Pastor, Lucas
المساهمون: Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA), Optimisation Combinatoire (G-SCOP_OC), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA), ANR-21-CE48-0004,GRALMECO,Algorithmique des problèmes de couverture métriques dans les graphes(2021), ANR-16-IDEX-0001,CAP 20-25,CAP 20-25(2016)
المصدر: 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). Leibniz International Proceedings in Informatics (LIPIcs)
Mathematical Foundations of Computer Science (MFCS)
https://hal.science/hal-04818742
Mathematical Foundations of Computer Science (MFCS), Aug 2024, Bratislava, Slovakia. pp.1-16, ⟨10.4230/LIPIcs.MFCS.2024.19⟩مصطلحات موضوعية: 2012 ACM Subject Classification Theory of computation → Online algorithms Theory of computation → Graph algorithms analysis Mathematics of computing → Graph algorithms phrases Canadian Traveller Problem, Online algorithms, Competitive analysis, Outerplanar graphs, 2012 ACM Subject Classification Theory of computation → Online algorithms, Theory of computation → Graph algorithms analysis, Mathematics of computing → Graph algorithms phrases Canadian Traveller Problem, Canadian Traveller Problem, Theory of computation → Online algorithms, Mathematics of computing → Graph algorithms, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
جغرافية الموضوع: Bratislava, Slovakia
-
3Conference
المؤلفون: Cosson, Romain, Massoulié, Laurent
المساهمون: Apprentissage, graphes et optimisation distribuée (ARGO), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), Dynamics of Geometric Networks (DYOGENE), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, ANR-19-P3IA-0001,PRAIRIE,PaRis Artificial Intelligence Research InstitutE(2019)
المصدر: ITCS 2024 - 15th Innovations in Theoretical Computer Science Conference ; https://hal.science/hal-04691075 ; ITCS 2024 - 15th Innovations in Theoretical Computer Science Conference, Jan 2024, Berkeley, CA, United States. ⟨10.4230/LIPIcs.ITCS.2024.35⟩
مصطلحات موضوعية: Collective exploration, Online algorithms, Evolving tree, Competitive analysis, Theory of computation → Online algorithms, Mathematics of computing → Graph algorithms, [INFO]Computer Science [cs]
جغرافية الموضوع: Berkeley, CA, United States
-
4Academic Journal
المؤلفون: Langedal, Kenneth, Hespe, Demian, Sanders, Peter
المصدر: ISSN: 1868-8969.
مصطلحات موضوعية: Graphs, Independent Set, Vertex Cover, Graph Neural Networks, Branch-and-Reduce, Mathematics of computing → Graph algorithms, Computing methodologies → Neural networks, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004
وصف الملف: application/pdf
Relation: Leibniz International Proceedings in Informatics (LIPIcs); info:eu-repo/semantics/altIdentifier/isbn/978-3-9597732-5-6; info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000173352; https://publikationen.bibliothek.kit.edu/1000173352/154079437; https://doi.org/10.5445/IR/1000173352
-
5Academic Journal
المؤلفون: Bläsius, Thomas, Katzmann, Maximilian, Wilhelm, Marcus
المصدر: ISSN: 1868-8969.
مصطلحات موضوعية: treewidth, weighted treewidth, algorithm engineering, cliques, clustering, complex networks, Mathematics of computing → Graph algorithms, Theory of computation → Graph algorithms analysis, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004
وصف الملف: application/pdf
Relation: Leibniz International Proceedings in Informatics; info:eu-repo/semantics/altIdentifier/isbn/978-3-9597727-9-2; info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000162490; https://publikationen.bibliothek.kit.edu/1000162490/155240625; https://doi.org/10.5445/IR/1000162490
-
6Conference
المساهمون: Algorithmes, Graphes et Combinatoire (LIRMM, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Modèles de calcul, Complexité, Combinatoire (MC2), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon), Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), ANR-21-CE48-0004,GRALMECO,Algorithmique des problèmes de couverture métriques dans les graphes(2021), ANR-20-CE48-0008,ELIT,Un Parcours par les Limites de l'Efficacité(2020)
المصدر: 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)
https://uca.hal.science/hal-04149792
19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024), 294, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp.11:1-11:18, 2023, ⟨10.4230/LIPIcs.SWAT.2024.11⟩مصطلحات موضوعية: intersection graphs, subexponential FPT algorithms, cycle-hitting problems, bidimensionality, geometric intersection graphs, Mathematics of computing → Graph algorithms, Theory of computation → Fixed parameter tractability, Theory of computation → Computational geometry, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2306.17710; ARXIV: 2306.17710
-
7Conference
المؤلفون: Geniet, Colin, Thomassé, Stéphan
المساهمون: Modèles de calcul, Complexité, Combinatoire (MC2), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), ANR-21-CE48-0014,TWIN-WIDTH,Twin-width: théorie et applications(2021), ANR-19-CE48-0013,DIGRAPHS,Digraphes(2019)
المصدر: Leibniz International Proceedings in Informatics (LIPIcs) ; 31st Annual European Symposium on Algorithms (ESA 2023) ; https://hal.science/hal-04249625 ; 31st Annual European Symposium on Algorithms (ESA 2023), Sep 2023, Amsterdam, Netherlands. pp.53:1--53:14, ⟨10.4230/LIPIcs.ESA.2023.53⟩
مصطلحات موضوعية: Tournaments, twin-width, first-order logic, model checking, NIP, small classes, Mathematics of computing → Graph algorithms, Mathematics of computing → Graph enumeration, Theory of computation → Finite Model Theory, [INFO]Computer Science [cs], [MATH]Mathematics [math]
جغرافية الموضوع: Amsterdam, Netherlands
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2207.07683; hal-04249625; https://hal.science/hal-04249625; https://hal.science/hal-04249625/document; https://hal.science/hal-04249625/file/LIPIcs-ESA-2023-53.pdf; ARXIV: 2207.07683
-
8Conference
المساهمون: Combinatorics, Optimization and Algorithms for Telecommunications (COATI), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UniCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UniCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UniCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UniCA), Czech Technical University in Prague (CTU), Ben-Gurion University of the Negev (BGU), ANR-15-IDEX-0001,UCA JEDI,Idex UCA JEDI(2015), ANR-17-EURE-0004,UCA DS4H,UCA Systèmes Numériques pour l'Homme(2017)
المصدر: Leibniz International Proceedings in Informatics (ISSN 1868-8969) ; MFCS 2023 - 48th International Symposium on Mathematical Foundations of Computer Science ; https://hal.science/hal-04271418 ; MFCS 2023 - 48th International Symposium on Mathematical Foundations of Computer Science, Aug 2023, Bordeaux, France. pp.42:1--42:14, ⟨10.4230/LIPIcs.MFCS.2023.42⟩
مصطلحات موضوعية: Hunter and Rabbit, Monotonicity, Graph Searching, Mathematics of computing → Graph algorithms, [INFO]Computer Science [cs]
-
9Academic JournalDPP-PMRF: Rethinking Optimization for a Probabilistic Graphical Model Using Data-Parallel Primitives
المؤلفون: Lessley, Brenton, Perciano, Talita, Heinemann, Colleen, Camp, David, Childs, Hank, Bethel, E Wes
مصطلحات موضوعية: Information and Computing Sciences, Computer Vision and Multimedia Computation, Bioengineering, Mathematics of computing-Graph algorithms, Markov networks, Expectation maximization, Computing methodologies-Image processing, Shared memory, cs.DC, graph algorithms, markov networks, image processing, parallel computing
وصف الملف: application/pdf
-
10Academic JournalDPP-PMRF: Rethinking Optimization for a Probabilistic Graphical Model Using Data-Parallel Primitives
المؤلفون: Lessley, B, Perciano, T, Heinemann, C, Camp, D, Childs, H, Bethel, EW
مصطلحات موضوعية: Mathematics of computing-Graph algorithms, Markov networks, Expectation maximization, Computing methodologies-Image processing, Shared memory, cs.DC, graph algorithms, markov networks, image processing, parallel computing
وصف الملف: application/pdf
URL الوصول: https://escholarship.org/uc/item/75b346h2
-
11Book
المصدر: ISSN: 1868-8969.
مصطلحات موضوعية: hyperbolic geometry, unit disk graphs, greedy routing, hyperbolic random graphs, graph classes, Theory of computation → Graph algorithms analysis, Theory of computation → Computational geometry, Mathematics of computing → Graph algorithms, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004
Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-9597726-6-2; info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000157578
-
12Conference
المؤلفون: Elaroussi, Mohammed, Nourine, Lhouari, Vilmin, Simon
المساهمون: Unité de recherche Laboratoire de Modélisation et Optimisation des Systèmes Université de Béjaïa (Unité de recherche LaMOS = Research unit LaMOS), Université Abderrahmane Mira Université de Béjaïa = University Abderrahmane Mira University of Béjaïa (UB), Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA), Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA), Polytech Marseille (AMU POLYTECH), Aix Marseille Université (AMU), Logique, Interaction, Raisonnement et Inférence, Complexité, Algèbre (LIRICA), Laboratoire d'Informatique et des Systèmes (LIS) (Marseille, Toulon) (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), CMEP Tassili project: "Argumentation et jeux: Structures et Algorithmes" (6085QH-21MDU320 PHC)IDEX-ISITE initiative 16-IDEX-0001 (CAP 20-25)
المصدر: Leibniz International Proceedings in Informatics (LIPIcs) ; Mathematical Foundation of Computer Science (MFCS) ; https://amu.hal.science/hal-04683675 ; Mathematical Foundation of Computer Science (MFCS), Aug 2024, Bratislava, Slovakia. ⟨10.4230/LIPIcs.MFCS.2024.51⟩
مصطلحات موضوعية: chordless paths, monophonic convexity, separation, half-space, Mathematics of computing → Paths and connectivity problems, Mathematics of computing → Graph algorithms, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
جغرافية الموضوع: Bratislava, Slovakia
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2404.17564; hal-04683675; https://amu.hal.science/hal-04683675; ARXIV: 2404.17564
-
13Academic Journal
المؤلفون: Giakkoupis, George, Saribekyan, Hayk, Sauerwald, Thomas
مصطلحات موضوعية: parallel random walks, information dissemination, infectious diseases, Mathematics of computing → Stochastic processes, Theory of computation → Random walks and Markov chains, Mathematics of computing → Graph algorithms
وصف الملف: application/pdf
Relation: https://hal.inria.fr/hal-02913942; https://dx.doi.org/10.4230/LIPIcs.DISC.2020; https://dx.doi.org/10.1109/SFCS.1979.34; https://dx.doi.org/10.1017/S0963548311000125; https://dx.doi.org/10.1214/aoap/1026915614; https://dx.doi.org/10.1137/S0097539790190144; https://dx.doi.org/10.1145/3173043; https://dx.doi.org/10.1080/15427951.2006.10129115; https://dx.doi.org/10.1007/978-3-642-22212-2_1; https://dx.doi.org/10.1137/080729542; https://dx.doi.org/10.1145/43921.43922; https://dx.doi.org/10.1016/j.dam.2006.04.026; https://dx.doi.org/10.1145/1993636.1993640; https://dx.doi.org/10.1007/978-3-642-03685-9_36; https://dx.doi.org/10.1016/j.tcs.2010.08.010; https://dx.doi.org/10.1002/rsa.3240010406; https://dx.doi.org/10.1145/3293611.3331622
-
14Conference
المؤلفون: Bhowmick, Ayan, Kumar, Meneni, Koushik, Danisch, Maximilien, Guillaume, Jean-Loup, Mitra, Bivas
المساهمون: Indian Institute of Technology Kharagpur (IIT Kharagpur), ComplexNetworks, LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Laboratoire Informatique, Image et Interaction - EA 2118 (L3I), La Rochelle Université (ULR)
المصدر: 13th ACM International WSDM Conference
https://hal.science/hal-02999888
13th ACM International WSDM Conference, Feb 2020, Houston, Texas, United States. pp.43-51, ⟨10.1145/3336191.3371800⟩مصطلحات موضوعية: CCS CONCEPTS • Computing methodologies → Machine learning algorithms, • Mathematics of computing → Graph algorithms KEYWORDS Network embedding, scalability, real-world graph algorithms, [INFO]Computer Science [cs], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI]
جغرافية الموضوع: Houston, Texas, United States
-
15Academic Journal
المؤلفون: Su, Hsin-Hao, Vu, Hoa T.
مصطلحات موضوعية: Distributed Algorithms, Network Algorithms, Data Summarization, Theory of computation → Distributed algorithms, Networks → Network algorithms, Mathematics of computing → Graph algorithms
وصف الملف: application/pdf
-
16Conference
المؤلفون: Equi, Massimo, Grossi, Roberto, Makinen, Veli
المساهمون: Helsingin yliopisto = Helsingfors universitet = University of Helsinki, Dipartimento di Informatica Pisa (DI), University of Pisa - Università di Pisa, Equipe de recherche européenne en algorithmique et biologie formelle et expérimentale (ERABLE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), The first two authors are grateful to Alessio Conte and Luca Versari for providing theircomments on the reduction. The last author wishes to thank the participants of the annualresearch group retreat on sparking the idea to studysethreductions in this context. Wethank the anonymous reviewers of an earlier version of this paper for useful suggestionsfor improving the presentation and for pointing out the connection to regular expression matching.
المصدر: ICALP 2019 - 46th International Colloquium on Automata, Languages and Programming ; https://inria.hal.science/hal-02338498 ; ICALP 2019 - 46th International Colloquium on Automata, Languages and Programming, Jul 2019, Patras, Greece. pp.1-15
مصطلحات موضوعية: labeled graphs, string matching, string search, strong exponential time hypothesis, variation graphs, 2012 ACM Subject Classification Mathematics of computing → Graph algorithms Theory of computation → Problems, exact pattern matching, graph query, graph search, heterogeneous networks, [INFO]Computer Science [cs]
Relation: hal-02338498; https://inria.hal.science/hal-02338498; https://inria.hal.science/hal-02338498/document; https://inria.hal.science/hal-02338498/file/1901.05264.pdf
-
17Conference
المؤلفون: Feghali, Carl, Lucke, Felicia, Paulusma, Daniël, Ries, Bernard
المساهمون: Modèles de calcul, Complexité, Combinatoire (MC2), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Université de Fribourg = University of Fribourg (UNIFR), Durham University, ANR-19-CE48-0013,DIGRAPHS,Digraphes(2019)
المصدر: ISAAC 2023 ; https://hal.science/hal-04632864 ; ISAAC 2023, Dec 2023, Kyoto (Japan), Japan. ⟨10.4230/LIPIcs.ISAAC.2023.31⟩
مصطلحات موضوعية: matching cut, perfect matching, girth, H-free graph, Mathematics of computing → Graph algorithms, [INFO]Computer Science [cs]
جغرافية الموضوع: Kyoto (Japan), Japan
Time: Kyoto (Japan), Japan
Relation: hal-04632864; https://hal.science/hal-04632864
-
18Conference
المؤلفون: Newton, Jim, Verna, Didier
المساهمون: Laboratoire de Recherche et de Développement de l'EPITA (LRDE), Ecole Pour l'Informatique et les Techniques Avancées (EPITA)
المصدر: European Lisp Symposium ; https://hal.archives-ouvertes.fr/hal-01770939 ; European Lisp Symposium, Apr 2018, Marbella, Spain
مصطلحات موضوعية: CCS CONCEPTS • Theory of computation → Data structures design and anal- ysis, Type theory, • Computing methodologies → Representation of Boolean functions, • Mathematics of computing → Graph algorithms, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Relation: hal-01770939; https://hal.archives-ouvertes.fr/hal-01770939; https://hal.archives-ouvertes.fr/hal-01770939/document; https://hal.archives-ouvertes.fr/hal-01770939/file/newton.18.els.pdf
-
19
المؤلفون: Donkers, Huib, Jansen, Bart M. P., Włodarczyk, Michał
المساهمون: Algorithms, Golovach, Petr A., Zehavi, Meirav
المصدر: Algorithmica, 84(11), 3407-3458. Springer
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, IPEC 2021مصطلحات موضوعية: FOS: Computer and information sciences, General Computer Science, Mathematics of computing ��� Graphs and surfaces, Outerplanar graphs, Mathematics of computing → Graph algorithms, Applied Mathematics, Theory of computation ��� Graph algorithms analysis, Mathematics of computing ��� Graph algorithms, Mathematics of computing → Graphs and surfaces, Computer Science Applications, Theory of computation → Graph algorithms analysis, Fixed-parameter tractability, Computer Science - Data Structures and Algorithms, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), Theory of computation ��� Parameterized complexity and exact algorithms, Kernelization
وصف الملف: application/pdf
-
20
المؤلفون: Kobayashi, Yasuaki, Otachi, Yota
المصدر: Algorithmica. 84:2379-2393
مصطلحات موضوعية: FOS: Computer and information sciences, General Computer Science, fixed-parameter tractability, Mathematics of computing → Graph algorithms, Applied Mathematics, Computer Science - Data Structures and Algorithms, Graph burning, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), parameterized complexity, Computer Science Applications