-
1Academic Journal
Authors: Focke, Jacob, Hörsch, FlorianAff1, IDs0045402500782x_cor1, Li, Shaohua, Marx, Dániel
Linked Full TextSource: Discrete & Computational Geometry. :1-60
-
2Academic Journal
Authors: Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke
Contributors: Jan Böker and Louis Härtel and Nina Runde and Tim Seppelt and Christoph Standke
Source: Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 19:1-19:20 (2024). doi:10.4230/LIPIcs.STACS.2024.19
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11-2024-03-14
41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)Subject Terms: FOS: Computer and information sciences, Mathematics of computing → Graph theory, Discrete Mathematics (cs.DM), Theory of computation → Graph algorithms analysis, graph homomorphism, parameterised complexity, Computer Science - Data Structures and Algorithms, counting complexity, FOS: Mathematics, Mathematics - Combinatorics, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics
File Description: application/pdf
-
3Academic Journal
Authors: Marx, Dániel, Sankar, Govind S., Schepper, PhilippAff1, IDs0045302401265w_cor1
Linked Full TextSource: Algorithmica. 87(1):22-88
-
4Academic Journal
Contributors: Robert Ganian and Thekla Hamm and Viktoriia Korchemna and Karolina Okrasa and Kirill Simonov, Bojańczyk, Mikołaj, Merelli, Emanuela, Woodruff, David P.
Source: ACM Transactions on Algorithms. 20:1-26
Subject Terms: FOS: Computer and information sciences, homomorphism, 68R10, 0102 computer and information sciences, G.2.2, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, fine-grained complexity, Homomorphism, Theory of computation → Parameterized complexity and exact algorithms, ddc:004, clique-width
File Description: application/pdf
-
5Academic Journal
Authors: Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michał Pilipczuk, Erik Jan van Leeuwen
Contributors: Benjamin Bergougnoux and Vera Chekan and Robert Ganian and Mamadou Moustapha Kanté and Matthias Mnich and Sang-il Oum and Michał Pilipczuk and Erik Jan van Leeuwen, Bergougnoux, Benjamin, DOREAU, Bastien, Sub Algorithms and Complexity, Algorithms and Complexity, Li Gortz, Inge, Farach-Colton, Martin, Puglisi, Simon J., Herman, Grzegorz, Gørtz, Inge Li
Source: ACM Transactions on Computation Theory.
Subject Terms: FOS: Computer and information sciences, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Parameterized complexity, algebraic methods, shrubdepth, Data Structures and Algorithms, Theory of computation → Parameterized complexity and exact algorithms, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Data Structures and Algorithms (cs.DS), ddc:004, space complexity
File Description: application/pdf
Access URL: http://arxiv.org/abs/2307.01285
http://10.10.70.176:8080/experts/en/publications/8b2e5cfb-2dbc-4b4f-9a00-19a72f8ebc29
https://doi.org/10.48550/arXiv.2307.01285
https://research-portal.uu.nl/en/publications/80bbb077-5744-4a6a-b94d-46d26a0c57d1
https://doi.org/10.4230/LIPIcs.ESA.2023.18
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.18
https://hal.science/hal-04492602v1
https://hal.science/hal-04492602v1/document
https://doi.org/10.1145/3723880
https://hal.science/hal-04492601v1
https://doi.org/10.4230/lipics.esa.2023.18
https://dspace.library.uu.nl/handle/1874/431814 -
6Book
Authors: Irene Finocchi, Loukas Georgiadis
Source: Lecture Notes in Computer Science ISBN: 9783031929311
Lecture Notes in Computer Science ISBN: 9783031929342File Description: application/pdf
-
7Academic Journal
Contributors: Hubie Chen and Bart M. P. Jansen and Karolina Okrasa and Astrid Pieterse and Paweł Rzążewski, Cao, Yixin, Cheng, Siu-Wing, Li, Minming
Source: 31st International Symposium on Algorithms and Computation (ISAAC 2020)
Subject Terms: FOS: Computer and information sciences, sparsification, Sparsification, Theory of computation → Problems, reductions and completeness, 0102 computer and information sciences, Computational Complexity (cs.CC), List H-coloring, 01 natural sciences, Computer Science - Computational Complexity, Theory of computation → Graph algorithms analysis, List H-Coloring, Mathematics of computing → Graph coloring, Theory of computation → Parameterized complexity and exact algorithms, ddc:004, Constraint Satisfaction Problem, constraint satisfaction problem
File Description: application/pdf
Access URL: http://arxiv.org/abs/2009.08353
https://research.tue.nl/en/publications/6cd0cd13-e63b-4cca-9d3b-800c69a29ca0
https://doi.org/10.1145/3612938
https://arxiv.org/abs/2009.08353
https://drops.dagstuhl.de/opus/volltexte/2020/13402/pdf/LIPIcs-ISAAC-2020-58.pdf/
http://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-08353
https://arxiv.org/pdf/2009.08353
https://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-08353
https://drops.dagstuhl.de/opus/volltexte/2020/13402/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.58 -
8Academic Journal
Contributors: Barış Can Esmer and Ariel Kulik and Dániel Marx and Philipp Schepper and Karol Węgrzycki, Dell, Holger, Nederlof, Jesper
Source: Algorithmica
17th International Symposium on Parameterized and Exact Computation
Leibniz International Proceedings in InformaticsSubject Terms: 0301 basic medicine, FOS: Computer and information sciences, Fast Fourier Transform, Generalized Convolution, 0102 computer and information sciences, 01 natural sciences, Article, 03 medical and health sciences, Computer Science - Data Structures and Algorithms, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), Theory of computation → Algorithm design techniques, ddc:004, Fast Subset Convolution
File Description: application/pdf
Linked Full TextAccess URL: https://pubmed.ncbi.nlm.nih.gov/38188497
http://arxiv.org/abs/2209.01623
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.12
http://hdl.handle.net/21.11116/0000-000C-1EE8-E
http://hdl.handle.net/21.11116/0000-000C-1EE6-0
http://hdl.handle.net/21.11116/0000-000E-36C4-8
http://hdl.handle.net/21.11116/0000-000E-36C6-6 -
9Conference
Contributors: Fluminense Federal University Niterói, Algorithmes, Graphes et Combinatoire (LIRMM, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Université de Perpignan Via Domitia (UPVD)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Université de Montpellier Paul-Valéry (UMPV)-Université de Perpignan Via Domitia (UPVD)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Université de Montpellier Paul-Valéry (UMPV), Knowledge representation, reasonning (ORPAILLEUR), Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), ANR-23-CE48-0017,Abysm,Bases algorithmiques pour l'étude des surfaces hyperboliques et leur espace des modules(2023), ANR-20-CE48-0008,ELIT,Un Parcours par les Limites de l'Efficacité(2020)
Source: ICALP 2025 - 52nd International Colloquium on Automata, Languages and Programming ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-05386275 ; ICALP 2025 - 52nd International Colloquium on Automata, Languages and Programming, Jul 2025, Aarhus, Denmark. pp.63:1-63:19, ⟨10.4230/LIPIcs.ICALP.2025.63⟩
Subject Terms: rotation distance, Parameterized complexity and exact algorithms, Combinatorics, graph associahedra, elimination tree, reconfiguration, combinatorial shortest path, fixed-parameter tractable algorithm, parameterized complexity, [MATH]Mathematics [math], [INFO]Computer Science [cs]
-
10Academic Journal
Authors: Dransfeld, Jonathan, Künnemann, Marvin, Redzic, Mirza, Benoit, Anne, Kaplan, Haim, Wild, Sebastian, Herman, Grzegorz
Source: ISSN: 1868-8969.
Subject Terms: fine-grained complexity theory, domination in graphs, subgraph isomorphism, classification theorem, parameterized algorithms, Theory of computation → Graph algorithms analysis, Theory of computation → Parameterized complexity and exact algorithms, Theory of computation → Problems, reductions and completeness, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004
File Description: application/pdf
Relation: Leibniz International Proceedings in Informatics (LIPIcs); info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000187239; https://publikationen.bibliothek.kit.edu/1000187239/169678057; https://doi.org/10.5445/IR/1000187239
-
11Academic Journal
Authors: Künnemann, Marvin, Redzic, Mirza
Source: ISSN: 1868-8969.
Subject Terms: Fine-grained complexity theory, Dominating set, Sparsity in graphs, Conditionally optimal algorithms, Theory of computation → Graph algorithms analysis, Theory of computation → Parameterized complexity and exact algorithms, Theory of computation → Problems, reductions and completeness, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004
File Description: application/pdf
Relation: Leibniz international proceedings in informatics : LIPIcs / Schloss Dagstuhl Leibniz-Zentrum für Informatik; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-353-9; info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000179197; https://publikationen.bibliothek.kit.edu/1000179197/157077211; https://doi.org/10.5445/IR/1000179197
-
12Conference
Authors: Foucaud, Florent, Galby, Esther, Khazaliya, Liana, Li, Shaohua, Mc Inerney, Fionn, Sharma, Roohani, Tale, Prafullkumar
Contributors: 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), 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)
Source: Leibniz International Proceedings in Informatics (LIPIcs) ; 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025) ; https://hal.science/hal-04963873 ; 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), Mar 2025, Jena, Germany. pp.33, ⟨10.4230/LIPIcs.STACS.2025.33⟩
Subject Terms: Parameterized Complexity, ETH-based Lower Bounds, Kernelization, Vertex Cover, Metric Dimension, Geodetic Set, Theory of computation → Parameterized complexity and exact algorithms, phrases Parameterized Complexity ETH-based Lower Bounds Kernelization Vertex Cover Metric Dimension Geodetic Set, phrases Parameterized Complexity, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
-
13Academic Journal
Authors: Lima, Paloma T., dos Santos, Vinicius F., Sau, Ignasi, Souza, Uéverton S., Tale, Prafullkumar
Contributors: Paloma T. Lima and Vinicius F. dos Santos and Ignasi Sau and Uéverton S. Souza and Prafullkumar Tale, Szeider, Stefan, Ganian, Robert, Silva, Alexandra
Source: Journal of Computer and System Sciences. 136:63-87
Subject Terms: FOS: Computer and information sciences, Computer Networks and Communications, Combinatorial Optimization and Complexity Theory, 0211 other engineering and technologies, Constraint Satisfaction Problems, G.2.2, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Running time, Graph, Edge contraction, Vertex cover, Computer Science - Data Structures and Algorithms, Combinatorial Optimization, FOS: Mathematics, Theory of computation → Parameterized complexity and exact algorithms, Mathematics - Combinatorics, Distributed Coordination in Online Robotics Research, Data Structures and Algorithms (cs.DS), Internal medicine, parameterized complexity, Graph power, Blocker problems, Line graph, F.2.2, Discrete mathematics, vertex cover, Vertex (graph theory), Algorithm, Computer Science - Computational Complexity, Parameterized complexity, 05C15, Computational Theory and Mathematics, Combinatorics, edge contraction, Computer Science, Physical Sciences, Contraction (grammar), Medicine, Combinatorics (math.CO), ddc:004, Mathematics, Graph Theory and Algorithms, Parameterized Complexity
File Description: application/pdf
Linked Full TextAccess URL: http://arxiv.org/abs/2202.03322
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.69 -
14Conference
Authors: De Oliveira, Mateus, 1982, Vadiee, Farhad
Source: 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024) Leibniz International Proceedings in Informatics.
Subject Terms: Automated reasoning, Parameterized complexity and exact algorithms, data- och systemvetenskap, Computer and Systems Sciences
File Description: print
-
15Academic Journal
Authors: Donkers, Huib, Jansen, Bart M. P., Włodarczyk, Michał
Contributors: Huib Donkers and Bart M. P. Jansen and Michał Włodarczyk, Golovach, Petr A., Zehavi, Meirav
Source: Algorithmica
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, IPEC 2021Subject Terms: outerplanar graphs, FOS: Computer and information sciences, Outerplanar graphs, Mathematics of computing → Graph algorithms, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Mathematics of computing → Graphs and surfaces, Theory of computation → Graph algorithms analysis, fixed-parameter tractability, Fixed-parameter tractability, kernelization, Computer Science - Data Structures and Algorithms, Theory of computation → Parameterized complexity and exact algorithms, Kernelization, Data Structures and Algorithms (cs.DS), ddc:004
File Description: application/pdf
Linked Full TextAccess URL: http://arxiv.org/abs/2110.01868
https://research.tue.nl/en/publications/83d8fa60-bba3-4c85-b7b2-ee39000667f4
https://doi.org/10.4230/LIPIcs.IPEC.2021.14
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.14 -
16Academic Journal
Authors: Jesper Nederlof, Céline M. F. Swennenhuis
Contributors: Jesper Nederlof and Céline M. F. Swennenhuis, Algorithms and Complexity, Sub Algorithms and Complexity, Cao, Yixin, Pilipczuk, Marcin
Source: Algorithmica
15th International Symposium on Parameterized and Exact Computation (IPEC 2020)Subject Terms: Fixed-Parameter Tractability, Precedence Constraints, Scheduling, Fixed-parameter tractability, Precedence constraints, 0211 other engineering and technologies, Theory of computation → Parameterized complexity and exact algorithms, 0102 computer and information sciences, 02 engineering and technology, ddc:004, 01 natural sciences, Article
File Description: application/pdf
Linked Full TextAccess URL: https://pubmed.ncbi.nlm.nih.gov/35880200
https://research.tue.nl/en/publications/1dfda552-8d00-4820-a6fd-0f10fccf657b
https://doi.org/10.1007/s00453-022-00970-8
https://research-portal.uu.nl/en/publications/a158321e-c759-4aab-8167-a64350fdcd0a
https://doi.org/10.1007/s00453-022-00970-8
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.25
https://dspace.library.uu.nl/handle/1874/431859
https://dspace.library.uu.nl/handle/1874/414804 -
17Academic Journal
Authors: Foucaud, Florent, Galby, Esther, Khazaliya, Liana, Li, Shaohua, Mc Inerney, Fionn, Sharma, Roohani, Tale, Prafullkumar
Contributors: Florent Foucaud and Esther Galby and Liana Khazaliya and Shaohua Li and Fionn Mc Inerney and Roohani Sharma and Prafullkumar Tale, Foucaud, Florent
Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), phrases Parameterized Complexity ETH-based Lower Bounds Kernelization Vertex Cover Metric Dimension Geodetic Set, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Computational Complexity (cs.CC), Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Vertex Cover, Metric Dimension, Theory of computation → Parameterized complexity and exact algorithms, Geodetic Set, Data Structures and Algorithms (cs.DS), Kernelization, Geodetic Sets, ETH-based Lower Bounds, ddc:004, phrases Parameterized Complexity, Computer Science - Discrete Mathematics, Parameterized Complexity
File Description: application/pdf
-
18Academic Journal
Contributors: Viennot, Laurent, David Coudert and Mónika Csikós and Guillaume Ducoffe and Laurent Viennot
Subject Terms: FOS: Computer and information sciences, algorithm, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], graph, VC-dimension, Algorithm, Theory of computation → Graph algorithms analysis, Computer Science - Data Structures and Algorithms, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Theory of computation → Algorithm design techniques, Graphs
File Description: application/pdf
-
19Conference
Contributors: Dibyayan Chakraborty and Antoine Dailly and Florent Foucaud and Ralf Klasing, Klasing, Ralf
Subject Terms: Theory of computation → Graph algorithms analysis, Dilworth's Theorem, DAGs, Treewidth, Temporally Disjoint Paths, Theory of computation → Parameterized complexity and exact algorithms, Oriented Trees, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Path Cover, Temporal Graphs, ddc:004, Algorithms
File Description: application/pdf
-
20Conference
Authors: Seppelt, Tim Frederik
Contributors: Tim Seppelt
Source: Saarbrücken/Wadern, Germany : Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 306, 82:1-82:19 (2024). doi:10.4230/LIPIcs.MFCS.2024.82
49th International Symposium on Mathematical Foundations of Computer Science : (MFCS 2024), August 26-30, 2024, Bratislava, Slovakia / Edited by Rastislav Královič, Antonín Kučera
49th International Symposium on Mathematical Foundations of Computer Science : (MFCS 2024), August 26-30, 2024, Bratislava, Slovakia / Edited by Rastislav Královič, Antonín Kučera49. International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, Bratislava, Slovakia, 2024-08-26-2024-08-30
49th International Symposium on Mathematical Foundations of Computer ScienceSubject Terms: Computer Science - Logic in Computer Science, Mathematics of computing → Graph theory, recognisability, Mathematics of computing → Combinatorics, graph minor, Courcelle's Theorem, Computer Science - Computational Complexity, Theory of computation → Graph algorithms analysis, graph homomorphism, randomised algorithm, Mathematics - Combinatorics, Theory of computation → Parameterized complexity and exact algorithms, homomorphism indistinguishability, ddc:004, Computer Science - Discrete Mathematics
File Description: application/pdf