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

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs

Autoři: Andreas Emil Feldmann Michael Lampis Andreas Emil Feldmann and Michael Lampis

Přispěvatelé: Andreas Emil Feldmann Michael Lampis Andreas Emil Feldmann and Michael Lampis

Zdroj: ACM Transactions on Algorithms. 21:1-26

Témata: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Approximation Algorithms, FPT algorithms, Steiner Forest

Popis souboru: application/pdf

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

Domination and Cut Problems on Chordal Graphs with Bounded Leafage

Autoři: Galby, Esther Marx, Dániel Schepper, Philipp a další

Přispěvatelé: Galby, Esther Marx, Dániel Schepper, Philipp a další

Zdroj: Algorithmica
17th International Symposium on Parameterized and Exact Computation
Leibniz International Proceedings in Informatics

Témata: FOS: Computer and information sciences, FPT Algorithms, F.2, 0102 computer and information sciences, Computational Complexity (cs.CC), FPT algorithms, Dominating Set, 01 natural sciences, MultiCut with Undeletable Terminals, MultiCut with undeletable terminals, Chordal Graphs, Theory of computation → Fixed parameter tractability, Multiway cut with undeletable terminals, Computer Science - Computational Complexity, Informatik, Dominating set, Leafage, Multiway Cut with Undeletable Terminals, Chordal graphs, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, 0101 mathematics, 68Q25, 68Q27

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2208.02850
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.14
http://hdl.handle.net/21.11116/0000-000E-596A-8
http://hdl.handle.net/21.11116/0000-000E-596C-6
http://hdl.handle.net/21.11116/0000-000C-1DB4-9
http://hdl.handle.net/21.11116/0000-000C-1DB2-B
http://hdl.handle.net/21.11116/0000-000C-1DF6-F
http://hdl.handle.net/21.11116/0000-000C-1DF8-D

Fast Gaussian Elimination for Low Treewidth Matrices

Autoři: Fürer, Martin Hoppen, Carlos Trevisan, Vilmar a další

Přispěvatelé: Fürer, Martin Hoppen, Carlos Trevisan, Vilmar a další

Témata: treewidth, Gaussian elimination, ddc:004, FPT algorithms

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.116

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs

Autoři: Gahlawat, Harmender Rathod, Abhishek Zehavi, Meirav a další

Přispěvatelé: Gahlawat, Harmender Rathod, Abhishek Zehavi, Meirav a další

Témata: FOS: Computer and information sciences, FPT Algorithms, Discrete Mathematics (cs.DM), T-Cycle, Computer Science - Data Structures and Algorithms, Kernelization, Data Structures and Algorithms (cs.DS), Subexponential Algorithmms, ddc:004, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

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

Feedback Vertex Set for Pseudo-disk Graphs in Subexponential FPT Time

Autoři: Berthe, Gaétan Bougeret, Marin Gonçalves, Daniel a další

Přispěvatelé: Berthe, Gaétan Bougeret, Marin Gonçalves, Daniel a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783031754081

Témata: Geometric inter section graphs, FOS: Computer and information sciences, Pseudo-disk graphs, Discrete Mathematics (cs.DM), Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Cycle-hitting problems, [INFO] Computer Science [cs], Subexponential FPT algorithms, Computer Science - Discrete Mathematics

Přístupová URL adresa: http://arxiv.org/abs/2410.23878
https://hal-lirmm.ccsd.cnrs.fr/lirmm-04938252v1
https://doi.org/10.1007/978-3-031-75409-8_5

Token Sliding Reconfiguration on DAGs

Autoři: Dirks, Jona Vigny, Alexandre Jona Dirks and Alexandre Vigny

Přispěvatelé: Dirks, Jona Vigny, Alexandre Jona Dirks and Alexandre Vigny

Témata: Graph theory, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Reconfiguration, Independent Sets, ddc:004, FPT algorithms, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

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

Pushing the frontiers of subexponential FPT time for Feedback Vertex Set

Autoři: Berthe, Gaétan Bougeret, Marin Gonçalves, Daniel a další

Přispěvatelé: Berthe, Gaétan Bougeret, Marin Gonçalves, Daniel a další

Témata: FOS: Computer and information sciences, geometric intersection graphs, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Subexponential FPT algorithms

Popis souboru: application/pdf

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

Parameterized Algorithms for the Drone Delivery Problem

Autoři: Bartlmae, Simon Hene, Andreas Könen, Joshua a další

Přispěvatelé: Bartlmae, Simon Hene, Andreas Könen, Joshua a další

Témata: Complexity, Delivery, FPT algorithms, Graph Theory

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.8

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

(Almost-)Optimal FPT Algorithm and Kernel for T-Cycle on Planar Graphs

Autoři: Gahlawat, Harmender Rathod, Abhishek Zehavi, Meirav a další

Přispěvatelé: Gahlawat, Harmender Rathod, Abhishek Zehavi, Meirav a další

Témata: FPT Algorithms, Kernelization, T-Cycle, Subexponential Algorithmms

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 334, 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.82

Dostupnost: https://doi.org/10.4230/LIPIcs.ICALP.2025.82
https://nbn-resolving.org/urn:nbn:de:0030-drops-234593
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.82

On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity

Autoři: Emilio Di Giacomo Walter Didimo Giuseppe Liotta a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783031492747

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, Parameterized complexity, Bend minimization, Computer Science - Data Structures and Algorithms, bend-minimization, Orthogonal drawings, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), FPT algorithms, parameterized complexity

Přístupová URL adresa: http://arxiv.org/abs/2308.13665
https://hdl.handle.net/11391/1585577
https://doi.org/10.1007/s00453-024-01260-1
https://hdl.handle.net/11391/1569590
https://doi.org/10.1007/978-3-031-49275-4_4

Decremental Sensitivity Oracles for Covering and Packing Minors

Autoři: Kanesh, Lawqueen Panolan, Fahad Ramanujan, M. S. a další

Přispěvatelé: Kanesh, Lawqueen Panolan, Fahad Ramanujan, M. S. a další

Témata: Sensitivity oracles, ddc:004, Data Structures, FPT algorithms

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.44

Swapping Mixed-Up Beers to Keep Them Cool

Autoři: Davide Bilo' Maurizio Fiusco Luciano Gualà a další

Přispěvatelé: Davide Bilo' Maurizio Fiusco Luciano Gualà a další

Témata: Complete Bipartite Graphs, FPT Algorithms, Colored Token Swapping, Labeled Token Swapping, NP-Hardness, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.5

Kick the cliques

Autoři: Berthe, Gaétan Bougeret, Marin Gonçalves, Daniel a další

Přispěvatelé: Berthe, Gaétan Bougeret, Marin Gonçalves, Daniel a další

Témata: FOS: Computer and information sciences, Implicit hitting set problems, Geometric intersection graphs, geometric intersection graphs, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), [INFO] Computer Science [cs], ddc:004, Subexponential FPT algorithms, implicit hitting set problems

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2407.01465
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2024.13
https://hal-lirmm.ccsd.cnrs.fr/lirmm-04938282v1
https://doi.org/10.4230/lipics.ipec.2024.13

Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local Radius

Autoři: Berthe, Gaétan Bougeret, Marin Gonçalves, Daniel a další

Přispěvatelé: Berthe, Gaétan Bougeret, Marin Gonçalves, Daniel a další

Zdroj: 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024), Leibniz International Proceedings in Informatics (LIPIcs)
SWAT 2024 - 19th Scandinavian Symposium and Workshops on Algorithm Theory
https://hal.science/hal-04778590
SWAT 2024 - 19th Scandinavian Symposium and Workshops on Algorithm Theory, Jun 2024, Helsinki, Finland. pp.11:1-11:18, ⟨10.4230/LIPIcs.SWAT.2024.11⟩

Témata: Geometric intersection graphs, Subexponential FPT algorithms, Cycle-hitting problems, Bidimensionality, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Geografické téma: Helsinki, Finland

Dostupnost: https://hal.science/hal-04778590
https://hal.science/hal-04778590v1/document
https://hal.science/hal-04778590v1/file/LIPIcs.SWAT.2024.11.pdf
https://doi.org/10.4230/LIPIcs.SWAT.2024.11

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs

Autoři: Feldmann, Andreas Emil Lampis, Michael University of Sheffield Sheffield a další

Přispěvatelé: Feldmann, Andreas Emil Lampis, Michael University of Sheffield Sheffield a další

Zdroj: ICALP 2024 ; https://hal.science/hal-04785912 ; ICALP 2024, Jul 2024, Talinn, Estonia. ⟨10.4230/LIPIcs.ICALP.2024.61⟩

Témata: FPT algorithms, Steiner Forest, Approximation Algorithms, [INFO]Computer Science [cs]

Geografické téma: Talinn, Estonia

Time: Talinn, Estonia

Dostupnost: https://hal.science/hal-04785912
https://hal.science/hal-04785912v1/document
https://hal.science/hal-04785912v1/file/LIPIcs.ICALP.2024.61.pdf
https://doi.org/10.4230/LIPIcs.ICALP.2024.61

Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius

Autoři: Berthe, Gaétan Bougeret, Marin Gonçalves, Daniel a další

Přispěvatelé: Berthe, Gaétan Bougeret, Marin Gonçalves, Daniel a další

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, Intersection graphs, cycle-hitting problems, Bidimensionality, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], bidimensionality, Cycle-hitting problems, Subexponential FPT algorithms, Geometric intersection graphs, subexponential FPT algorithms, geometric intersection graphs, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004

Popis souboru: application/pdf

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

Domination and cut problems on chordal graphs with bounded leafage

Autoři: Galby, Esther Marx, Dániel Schepper, Philipp a další

Témata: Chordal graphs, Dominating set, FPT algorithms, Leafage, MultiCut with undeletable terminals, Multiway cut with undeletable terminals, 004: Computer Sciences

Popis souboru: application/pdf

Relation: Algorithmica; Projekt DEAL; https://hdl.handle.net/11420/45292

Dostupnost: https://hdl.handle.net/11420/45292
https://doi.org/10.15480/882.9101

An FPT Algorithm for Directed Co-Graph Edge Deletion

Autoři: Li, Wenjun Yang, Xueying Xu, Chao a další

Témata: ddc:330, edge deletion, FPT algorithms, directed co-graphs, forbidden structures

Relation: hdl:20.500.11880/39128

Dostupnost: http://nbn-resolving.org/urn:nbn:de:bsz:291--ds-436598
https://doi.org/10.22028/D291-43659
https://doi.org/10.3390/a17020069

An FPT Algorithm for Directed Co-Graph Edge Deletion

Autoři: Wenjun Li Xueying Yang Chao Xu a další

Zdroj: Algorithms, Vol 17, Iss 2, p 69 (2024)

Témata: edge deletion, FPT algorithms, directed co-graphs, forbidden structures, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95

Relation: https://www.mdpi.com/1999-4893/17/2/69; https://doaj.org/toc/1999-4893; https://doaj.org/article/2f31faaece5c4a909868d8cc2542e213

Dostupnost: https://doi.org/10.3390/a17020069
https://doaj.org/article/2f31faaece5c4a909868d8cc2542e213

Dual Parameterization of Weighted Coloring

Autoři: Julio Araújo Víctor Campos Carlos V. G. C. Lima a další

Přispěvatelé: Julio Araújo Víctor Campos Carlos V. G. C. Lima a další

Zdroj: Algorithmica. 82:2316-2336

Témata: FOS: Computer and information sciences, Nurr1/CoREST Pathway in Neuroprotection and Inflammation, 0211 other engineering and technologies, G.2.2, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), Graph Labeling, 01 natural sciences, Graph, Cellular and Molecular Neuroscience, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Graph Labeling and Dimension Problems, parameterized complexity, Statistics, Edge Coloring, Life Sciences, F.2.2, Partition (number theory), Discrete mathematics, FPT algorithms, Computer science, Vertex (graph theory), Programming language, dual parameterization, Computer Science - Computational Complexity, Parameterized complexity, Weight function, 05C15, Computational Theory and Mathematics, polynomial kernels, Combinatorics, split graphs, Computer Science, Physical Sciences, max coloring, interval graphs, Integer (computer science), ddc:004, weighted coloring, Mathematics, Graph Theory and Algorithms, Neuroscience, Parameterized Complexity

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/pdf/1805.06699
http://arxiv.org/abs/1805.06699
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02989870/document
https://dblp.uni-trier.de/db/journals/corr/corr1805.html#abs-1805-06699
https://link.springer.com/article/10.1007/s00453-020-00686-7
https://arxiv.org/abs/1805.06699
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02989870
http://arxiv.org/pdf/1805.06699.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.12
https://hdl.handle.net/2158/1351963
https://drops.dagstuhl.de/opus/volltexte/2019/10213/
https://doi.org/10.4230/LIPIcs.IPEC.2018.12
https://hdl.handle.net/2158/1351938
https://doi.org/10.1007/s00453-020-00686-7
https://link.springer.com/article/10.1007/s00453-020-00686-7