Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern

Συγγραφείς: Focke, Jacob, Hörsch, Florian^{Aff1, IDs0045402500782x_cor1}, Li, Shaohua, Marx, Dániel

Πηγή: Discrete & Computational Geometry. :1-60

The Complexity of Homomorphism Reconstructibility

Συγγραφείς: Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke

Συνεισφορές: Jan Böker and Louis Härtel and Nina Runde and Tim Seppelt and Christoph Standke

Πηγή: 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)

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2310.09009
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.19
https://publications.rwth-aachen.de/record/981455

Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)

Συγγραφείς: Marx, Dániel, Sankar, Govind S., Schepper, Philipp^{Aff1, IDs0045302401265w_cor1}

Πηγή: Algorithmica. 87(1):22-88

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width

Συγγραφείς: Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov

Συνεισφορές: Robert Ganian and Thekla Hamm and Viktoriia Korchemna and Karolina Okrasa and Kirill Simonov, Bojańczyk, Mikołaj, Merelli, Emanuela, Woodruff, David P.

Πηγή: ACM Transactions on Algorithms. 20:1-26

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2210.06845
https://research-portal.uu.nl/en/publications/267ac613-4a4f-419e-9dfc-dd7626cf5bef
https://doi.org/10.1145/3652514
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.66

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

Συγγραφείς: Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michał Pilipczuk, Erik Jan van Leeuwen

Συνεισφορές: 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

Πηγή: ACM Transactions on Computation Theory.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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

Algorithms and Complexity: 14th International Conference, CIAC 2025, Rome, Italy, June 10–12, 2025, Proceedings, Part I

Συγγραφείς: Irene Finocchi, Loukas Georgiadis

Πηγή: Lecture Notes in Computer Science ISBN: 9783031929311
Lecture Notes in Computer Science ISBN: 9783031929342

Θεματικοί όροι: algorithms, data structures, theoretical computer science. graph algorithms, approximation algorithms, online algorithms, streaming, distributed and parallel algorithms, parameterized complexity and exact algorithms, computational complexity, geometry, randomness, combinatorics

Περιγραφή αρχείου: application/pdf

Sparsification Lower Bounds for List H -Coloring

Συγγραφείς: Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Paweł Rzążewski

Συνεισφορές: Hubie Chen and Bart M. P. Jansen and Karolina Okrasa and Astrid Pieterse and Paweł Rzążewski, Cao, Yixin, Cheng, Siu-Wing, Li, Minming

Πηγή: 31st International Symposium on Algorithms and Computation (ISAAC 2020)

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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

Computing Generalized Convolutions Faster Than Brute Force

Συγγραφείς: Esmer, Barış Can, Kulik, Ariel, Marx, Dániel, Schepper, Philipp, Węgrzycki, Karol

Συνεισφορές: Barış Can Esmer and Ariel Kulik and Dániel Marx and Philipp Schepper and Karol Węgrzycki, Dell, Holger, Nederlof, Jesper

Πηγή: Algorithmica
17th International Symposium on Parameterized and Exact Computation
Leibniz International Proceedings in Informatics

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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

Computing Distances on Graph Associahedra Is Fixed-Parameter Tractable

Συγγραφείς: Cunha, Luís Felipe I., Sau, Ignasi, Souza, Uéverton, Valencia-Pabon, Mario

Συνεισφορές: 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)

Πηγή: 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⟩

Θεματικοί όροι: 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]

Θέμα γεωγραφικό: Aarhus, Denmark

Διαθεσιμότητα: https://hal-lirmm.ccsd.cnrs.fr/lirmm-05386275
https://hal-lirmm.ccsd.cnrs.fr/lirmm-05386275v1/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-05386275v1/file/Computing%20Distances%20on%20Graph%20Associahedra%20is.pdf
https://doi.org/10.4230/LIPIcs.ICALP.2025.63

Fine-Grained Classification of Detecting Dominating Patterns

Συγγραφείς: Dransfeld, Jonathan, Künnemann, Marvin, Redzic, Mirza, Benoit, Anne, Kaplan, Haim, Wild, Sebastian, Herman, Grzegorz

Πηγή: ISSN: 1868-8969.

Θεματικοί όροι: 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

Περιγραφή αρχείου: 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

Διαθεσιμότητα: https://publikationen.bibliothek.kit.edu/1000187239
https://publikationen.bibliothek.kit.edu/1000187239/169678057
https://doi.org/10.5445/IR/1000187239

Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs

Συγγραφείς: Künnemann, Marvin, Redzic, Mirza

Πηγή: ISSN: 1868-8969.

Θεματικοί όροι: 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

Περιγραφή αρχείου: 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

Διαθεσιμότητα: https://publikationen.bibliothek.kit.edu/1000179197
https://publikationen.bibliothek.kit.edu/1000179197/157077211
https://doi.org/10.5445/IR/1000179197

Metric Dimension and Geodetic Set Parameterized by Vertex Cover

Συγγραφείς: Foucaud, Florent, Galby, Esther, Khazaliya, Liana, Li, Shaohua, Mc Inerney, Fionn, Sharma, Roohani, Tale, Prafullkumar

Συνεισφορές: 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)

Πηγή: 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⟩

Θεματικοί όροι: 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]

Θέμα γεωγραφικό: Jena, Germany

Διαθεσιμότητα: https://hal.science/hal-04963873
https://hal.science/hal-04963873v1/document
https://hal.science/hal-04963873v1/file/MetricDimension_GeodeticSet_param_by_VertexCover_STACS_2025.pdf
https://doi.org/10.4230/LIPIcs.STACS.2025.33

Reducing the vertex cover number via edge contractions

Συγγραφείς: Lima, Paloma T., dos Santos, Vinicius F., Sau, Ignasi, Souza, Uéverton S., Tale, Prafullkumar

Συνεισφορές: 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

Πηγή: Journal of Computer and System Sciences. 136:63-87

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2202.03322
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.69

State Canonization and Early Pruning in Width-Based Automated Theorem Proving

Συγγραφείς: De Oliveira, Mateus, 1982, Vadiee, Farhad

Πηγή: 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024) Leibniz International Proceedings in Informatics.

Θεματικοί όροι: Automated reasoning, Parameterized complexity and exact algorithms, data- och systemvetenskap, Computer and Systems Sciences

Περιγραφή αρχείου: print

Σύνδεσμος πρόσβασης: https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-238214
https://doi.org/10.4230/LIPIcs.FSCD.2024.33

Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size: An Elementary Kernel of Quartic Size

Συγγραφείς: Donkers, Huib, Jansen, Bart M. P., Włodarczyk, Michał

Συνεισφορές: Huib Donkers and Bart M. P. Jansen and Michał Włodarczyk, Golovach, Petr A., Zehavi, Meirav

Πηγή: Algorithmica
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, IPEC 2021

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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

On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan

Συγγραφείς: Jesper Nederlof, Céline M. F. Swennenhuis

Συνεισφορές: Jesper Nederlof and Céline M. F. Swennenhuis, Algorithms and Complexity, Sub Algorithms and Complexity, Cao, Yixin, Pilipczuk, Marcin

Πηγή: Algorithmica
15th International Symposium on Parameterized and Exact Computation (IPEC 2020)

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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

Metric Dimension and Geodetic Set Parameterized by Vertex Cover

Συγγραφείς: Foucaud, Florent, Galby, Esther, Khazaliya, Liana, Li, Shaohua, Mc Inerney, Fionn, Sharma, Roohani, Tale, Prafullkumar

Συνεισφορές: Florent Foucaud and Esther Galby and Liana Khazaliya and Shaohua Li and Fionn Mc Inerney and Roohani Sharma and Prafullkumar Tale, Foucaud, Florent

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2405.01344
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.33

Practical Computation of Graph VC-Dimension

Συγγραφείς: Coudert, David, Csikós, Mónika, Ducoffe, Guillaume, Viennot, Laurent

Συνεισφορές: Viennot, Laurent, David Coudert and Mónika Csikós and Guillaume Ducoffe and Laurent Viennot

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2405.07588
https://hal.science/hal-04553784v1
https://doi.org/10.4230/lipics.sea.2024.8
https://hal.science/hal-04553784v1/document
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.8

Algorithms and Complexity for Path Covers of Temporal DAGs

Συγγραφείς: Chakraborty, Dibyayan, Dailly, Antoine, Foucaud, Florent, Klasing, Ralf

Συνεισφορές: Dibyayan Chakraborty and Antoine Dailly and Florent Foucaud and Ralf Klasing, Klasing, Ralf

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.38

An Algorithmic Meta Theorem for Homomorphism Indistinguishability

Συγγραφείς: Seppelt, Tim Frederik

Συνεισφορές: Tim Seppelt

Πηγή: 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 Science

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2402.08989
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.82
https://publications.rwth-aachen.de/record/991819