Výsledky vyhledávání - "parameterized algorithms"

Parameterized Max Min Feedback Vertex Set

Autoři: Michael Lampis Nikolaos Melissinos Manolis Vasilakis a další

Přispěvatelé: Michael Lampis Nikolaos Melissinos Manolis Vasilakis a další

Zdroj: SIAM Journal on Discrete Mathematics. 39:1587-1620

Témata: FOS: Computer and information sciences, Parameterized algorithms, Computer Science - Computational Complexity, ETH, Treewidth, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, Computational Complexity (cs.CC), Feedback vertex set, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2302.09604
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.62

Computing Tree Decompositions with Small Independence Number

Autoři: Clément Dallard Fedor V. Fomin Petr A. Golovach a další

Přispěvatelé: Clément Dallard Fedor V. Fomin Petr A. Golovach a další

Zdroj: Leibniz International Proceedings in Informatics
51:1-51:18

Témata: FOS: Computer and information sciences, parameterized algorithms, Data Structures and Algorithms, Combinatorics, FOS: Mathematics, Data Structures and Algorithms (cs.DS), tree-independence number, 0102 computer and information sciences, Combinatorics (math.CO), ddc:004, approximation, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2207.09993
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.51
https://hdl.handle.net/11250/3185366

Parameterized Restless Temporal Path

Autoři: Cauvi, Justine Viennot, Laurent

Přispěvatelé: Cauvi, Justine Viennot, Laurent

Zdroj: Lecture Notes in Computer Science ISBN: 9783032046994

Témata: FOS: Computer and information sciences, Parameterized algorithms, Temporal graphs, Computational Complexity, Data Structures and Algorithms, Interval-membership-width, Restless temporal paths, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Data Structures and Algorithms (cs.DS), Computational Complexity (cs.CC)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2507.05760
https://inria.hal.science/hal-05144137v1

Twin-Width III: Max Independent Set, Min Dominating Set, and Coloring

Autoři: Bonnet, Édouard Geniet, Colin Kim, Eun Jung a další

Přispěvatelé: Bonnet, Édouard Geniet, Colin Kim, Eun Jung a další

Zdroj: SIAM Journal on Computing. 53:1602-1640

Témata: FOS: Computer and information sciences, Parameterized Algorithms, Discrete Mathematics (cs.DM), 0102 computer and information sciences, [INFO] Computer Science [cs], Computational Complexity (cs.CC), Exact Algorithms, 01 natural sciences, Max Independent Set, Min Dominating Set, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Coloring, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), 05C85, Combinatorics (math.CO), ddc:004, F.2.2, Approximation Algorithms, Twin-width, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2007.14161
https://dblp.uni-trier.de/db/journals/corr/corr2007.html#abs-2007-14161
http://ui.adsabs.harvard.edu/abs/2020arXiv200714161B/abstract
https://arxiv.org/abs/2007.14161
https://arxiv.org/pdf/2007.14161v1
https://basepub.dauphine.psl.eu/handle/123456789/22127
https://drops.dagstuhl.de/opus/volltexte/2021/14104/
https://dblp.uni-trier.de/db/conf/icalp/icalp2021.html#BonnetG0TW21
https://drops.dagstuhl.de/opus/volltexte/2021/14104/pdf/LIPIcs-ICALP-2021-35.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.35

Assigning times to minimise reachability in temporal graphs

Autoři: Enright, Jessica Meeks, Kitty Skerman, Fiona

Zdroj: Journal of computer and system sciences (Print). 115:169-186

Témata: Graph modification, Graph contagion, Influence spreading, Temporal paths, Parameterized algorithms

Popis souboru: electronic

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-424498
https://doi.org/10.1016/j.jcss.2020.08.001

On the parameterized complexity of computing tree-partitions

Autoři: Bodlaender, Hans L. Groenland, Carla Jacob, Hugo a další

Přispěvatelé: Bodlaender, Hans L. Groenland, Carla Jacob, Hugo a další

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol vol. 26:3, Iss Discrete Algorithms (2025)
IPEC
17th International Symposium on Parameterized and Exact Computation (IPEC 2022)

Témata: FOS: Computer and information sciences, Domino Treewidth, parameterized algorithms, Discrete Mathematics (cs.DM), Treewidth, 0102 computer and information sciences, 01 natural sciences, Parameterized algorithms, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph algorithms (graph-theoretic aspects), QA1-939, treewidth, tree-partition-width, approximation algorithms, parameterized complexity, tree-partitions, Approximation algorithms, computer science - discrete mathematics, tree-cut width, Tree partitions, ddc:004, domino treewidth, Approximation Algorithms, Software, Mathematics, Parameterized Complexity, Computer Science - Discrete Mathematics

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2206.11832
https://zbmath.org/8037153
https://doi.org/10.46298/dmtcs.12540
https://doaj.org/article/8750a6fe844e48d9b4c5b8dca7a46e5b
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.7
https://dspace.library.uu.nl/handle/1874/425596

Crossing and Independent Families Among Polygons

Autoři: Brötzner, Anna Ganian, Robert Hamm, Thekla a další

Zdroj: 19th International Symposium on Algorithms and Data Structures (WADS 2025) Leibniz International Proceedings in Informatics (LIPIcs).

Témata: computational geometry, crossing families, crossing-free matchings, parameterized algorithms, segment intersection graphs

Popis souboru: electronic

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-80176
https://doi.org/10.4230/LIPIcs.WADS.2025.11

Fine-Grained Classification Of Detecting Dominating Patterns

Autoři: Dransfeld, Jonathan Künnemann, Marvin Redzic, Mirza a další

Přispěvatelé: Dransfeld, Jonathan Künnemann, Marvin Redzic, Mirza a další

Témata: FOS: Computer and information sciences, domination in graphs, Computational Complexity, parameterized algorithms, Data Structures and Algorithms, classification theorem, fine-grained complexity theory, Data Structures and Algorithms (cs.DS), subgraph isomorphism, ddc:004, Computational Complexity (cs.CC)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2509.22332
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.98

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms

Autoři: Depian, Thomas Fink, Simon D. Ganian, Robert a další

Přispěvatelé: Depian, Thomas Fink, Simon D. Ganian, Robert a další

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, parameterized algorithms, Data Structures and Algorithms, stack layouts, vertex integrity, Ramsey theory, Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, queue layouts

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2508.16319
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.15

Parameterized Algorithms for Computing Pareto Sets

Autoři: Könen, Joshua Marc Röglin, Heiko Stuck, Tarek a další

Přispěvatelé: Könen, Joshua Marc Röglin, Heiko Stuck, Tarek a další

Témata: polygon aggregation, FOS: Computer and information sciences, parameterized algorithms, Data Structures and Algorithms, treewidth, multicriteria optimization problems, multicriteria TSP, Data Structures and Algorithms (cs.DS), multicriteria MST, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2509.06124
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.105

Visualization of Event Graphs for Train Schedules

Autoři: Hartleb, Johann Schmidt, Marie Wolf, Samuel a další

Přispěvatelé: Hartleb, Johann Schmidt, Marie Wolf, Samuel a další

Témata: Integer Linear Programming, Computational Geometry (cs.CG), FOS: Computer and information sciences, Parameterized Algorithms, Treewidth, Graph Drawing, Computational Geometry, ddc:004, Event Graphs

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2503.01808
https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2025.4

Solving Co-Path/Cycle Packing and Co-Path Packing Faster than 3^K

Autoři: Liu, Yuxi Xiao, Mingyu Yuxi Liu and Mingyu Xiao

Přispěvatelé: Liu, Yuxi Xiao, Mingyu Yuxi Liu and Mingyu Xiao

Témata: FOS: Computer and information sciences, Path Decomposition, Parameterized Algorithms, Co-Path Packing, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Graph Algorithms, ddc:004, Co-Path/Cycle Packing, Cut & Count

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2406.10829
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2024.11

The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs

Autoři: Fischer, Nick Künnemann, Marvin Redžić, Mirza a další

Přispěvatelé: Fischer, Nick Künnemann, Marvin Redžić, Mirza a další

Témata: clique detections in hypergraphs, FOS: Computer and information sciences, Computer Science - Computational Complexity, parameterized algorithms, constraint satisfaction, fine-grained complexity theory, ddc:004, Computational Complexity (cs.CC)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2505.17314
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.78

Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering

Autoři: Gadekar, Ameet Inamdar, Tanmay Ameet Gadekar and Tanmay Inamdar

Přispěvatelé: Gadekar, Ameet Inamdar, Tanmay Ameet Gadekar and Tanmay Inamdar

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, Clustering, Parameterized algorithms, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, FPT approximation, k-Median, k-Center

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2501.03663
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.35

Efficient parameterized algorithms for computing all-pairs shortest paths

Autoři: Stefan Kratsch Florian Nelles Stefan Kratsch and Florian Nelles

Přispěvatelé: Stefan Kratsch Florian Nelles Stefan Kratsch and Florian Nelles

Zdroj: Discrete Applied Mathematics. 341:102-119

Témata: FOS: Computer and information sciences, Clique-width, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, parameterized Complexity, 01 natural sciences, Modular-width, All-pairs shortest Paths, efficient parameterized Algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2001.04908
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.38

Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter

Autoři: Kaul, Matthias Mnich, Matthias Spoerhase, Joachim a další

Přispěvatelé: Kaul, Matthias Mnich, Matthias Spoerhase, Joachim a další

Zdroj: Transaction on Algorithms

Témata: ta113, FOS: Computer and information sciences, Parameterized Algorithms, Treewidth, Computer Science - Data Structures and Algorithms, Mathematik, 0211 other engineering and technologies, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Sparsest Cut

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2111.06299
http://juuli.fi/Record/0677811423
https://doi.org/10.1145/3632623
https://aaltodoc.aalto.fi/handle/123456789/124900

Graph Coloring Below Guarantees via Co-Triangle Packing

Autoři: Akmal, Shyan Koana, Tomohiro Shyan Akmal and Tomohiro Koana

Přispěvatelé: Akmal, Shyan Koana, Tomohiro Shyan Akmal and Tomohiro Koana

Témata: coloring, parameterized algorithms, algebraic algorithms, above-guarantee, below-guarantee, subset convolution, determinants

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 359, 36th International Symposium on Algorithms and Computation (ISAAC 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.5

Dostupnost: https://doi.org/10.4230/LIPIcs.ISAAC.2025.5
https://nbn-resolving.org/urn:nbn:de:0030-drops-249130
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.5

Cluster Editing on Cographs and Related Classes

Autoři: Lafond, Manuel López Sánchez, Alitzel Luo, Weidong a další

Přispěvatelé: Lafond, Manuel López Sánchez, Alitzel Luo, Weidong a další

Témata: Cluster editing, cographs, parameterized algorithms, clique-width, trivially perfect graphs

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 327, 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.64

Dostupnost: https://doi.org/10.4230/LIPIcs.STACS.2025.64
https://nbn-resolving.org/urn:nbn:de:0030-drops-228895
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.64

Parameterized Geometric Graph Modification with Disk Scaling

Autoři: Fomin, Fedor V. Golovach, Petr A. Inamdar, Tanmay a další

Přispěvatelé: Fomin, Fedor V. Golovach, Petr A. Inamdar, Tanmay a další

Témata: parameterized algorithms, kernelization, spreading points, distant representatives, unit disk packing

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 325, 16th Innovations in Theoretical Computer Science Conference (ITCS 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.51

Dostupnost: https://doi.org/10.4230/LIPIcs.ITCS.2025.51
https://nbn-resolving.org/urn:nbn:de:0030-drops-226795
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.51

The Bounded Pathwidth of Control-Flow Graphs

Autoři: Giovanna Kobus Conrado Amir Kafshdar Goharshady Chun Kit Lam

Zdroj: Proceedings of the ACM on Programming Languages. 7:292-317

Témata: Parameterized Algorithms, Treewidth, 0202 electrical engineering, electronic engineering, information engineering, Pathwidth, 0102 computer and information sciences, 02 engineering and technology, Control-flow Graphs, 16. Peace & justice, 01 natural sciences