Euclidean TSP in Narrow Strips

Authors: Henk Alkema, Mark de Berg, Remco van der Hofstad, Sándor Kisfaludi-Bak

Contributors: Department of Computer Science, Professorship Kisfaludi-Bak Sándor, Computer Science Professors, Computer Science - Algorithms and Theoretical Computer Science (TCS) - Research area, Eindhoven University of Technology, Aalto-yliopisto, Aalto University

Source: Discrete & Computational Geometry. 71:1456-1506

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Fixed-parameter tractable algorithms, Bitonic TSP, 0211 other engineering and technologies, 68Q25, Computer Science - Computational Geometry, 68W40, 0102 computer and information sciences, 02 engineering and technology, Euclidean TSP, 01 natural sciences, Computational geometry

File Description: application/pdf

Access URL: http://arxiv.org/abs/2003.09948
https://aaltodoc.aalto.fi/handle/123456789/127402

Fine-Grained Equivalence for Problems Related to Integer Linear Programming

Authors: Rohwedder, Lars, Węgrzycki, Karol

Contributors: Lars Rohwedder and Karol Węgrzycki

Subject Terms: Integer Programming, Fine-Grained Complexity, Fixed-Parameter Tractable Algorithms

File Description: 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.83

Availability: https://doi.org/10.4230/LIPIcs.ITCS.2025.83
https://nbn-resolving.org/urn:nbn:de:0030-drops-227114
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.83

Diverse collections in matroids and graphs

Authors: Fomin, Fedor V., Golovach, Petr A., Panolan, Fahad, Philip, Geevarghese, Saurabh, Saket

Contributors: Fedor V. Fomin and Petr A. Golovach and Fahad Panolan and Geevarghese Philip and Saket Saurabh, Bläser, Markus, Monmege, Benjamin

Source: Math Program
Mathematical programming
Leibniz International Proceedings in Informatics

Subject Terms: Matroids, Diverse solutions, FOS: Computer and information sciences, Theory of computation → Fixed parameter tractability, Fixed-parameter tractable algorithms, Full Length Paper, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, 01 natural sciences

File Description: application/pdf

Access URL: https://pubmed.ncbi.nlm.nih.gov/38371324
http://arxiv.org/abs/2101.04633
https://hdl.handle.net/11250/2927158
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.31
https://hdl.handle.net/11250/3127015

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number

Authors: Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi

Contributors: Pranabendu Misra and Saket Saurabh and Roohani Sharma and Meirav Zehavi

Source: Algorithmica

Subject Terms: bounded independence number digraph, sub-exponential fixed-parameter tractable algorithms, directed feedback arc set, directed cutwidth, 0102 computer and information sciences, ddc:004, optimal linear arrangement, 01 natural sciences, Article

File Description: application/pdf

Access URL: https://pubmed.ncbi.nlm.nih.gov/37362859
https://drops.dagstuhl.de/opus/volltexte/2018/9934/pdf/LIPIcs-FSTTCS-2018-35.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.35
http://hdl.handle.net/21.11116/0000-000C-9037-3
http://hdl.handle.net/21.11116/0000-000C-9039-1

Infrared: a declarative tree decomposition-powered framework for bioinformatics

Authors: Yao, Hua-Ting^{Aff1, Aff2, Aff3, IDs13015024002582_cor1}, Marchand, Bertrand, Berkemer, Sarah J.^{Aff1, Aff4}, Ponty, Yann, Will, Sebastian^{Aff1, IDs13015024002582_cor5}

Source: Algorithms for Molecular Biology. 19(1)

Fine-Grained Equivalence for Problems Related to Integer Linear Programming

Authors: Rohwedder, Lars, Węgrzycki, Karol

Contributors: Lars Rohwedder and Karol Węgrzycki

Subject Terms: Fixed-Parameter Tractable Algorithms, FOS: Computer and information sciences, Computer Science - Computational Complexity, Fine-Grained Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Computational Complexity (cs.CC), Integer Programming

File Description: application/pdf

Access URL: http://arxiv.org/abs/2409.03675
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.83

A single exponential-time FPT algorithm for cactus contraction

Authors: Krithika, R. ^{a, ⁎}, Misra, Pranabendu ^b, Tale, Prafullkumar ^{c, ⁎}

Source: In Theoretical Computer Science 18 April 2023 954

Infrared: a declarative tree decomposition-powered framework for bioinformatics

Authors: Yao, Hua-Ting, Marchand, Bertrand, Berkemer, Sarah, Ponty, Yann, Will, Sebastian

Contributors: Yao, Hua-Ting, Algorithms and Models for Integrative BIOlogy (AMIBIO), Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX), École polytechnique (X), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS), Universität Wien = University of Vienna, Laboratoire d'Informatique Gaspard-Monge (LIGM), École nationale des ponts et chaussées (ENPC)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel, Tokyo Institute of Technology Tokyo (TITECH), ANR-21-CE45-0034,INSSANE,Modélisation Structurale d'ARN Intégrant des Données de Séquençage(2021), ANR-19-CE45-0023,PaRNAssus,Décrypter les architectures complexes d'ARN par sondage et interactions(2019)

Source: Algorithms Mol Biol
Algorithms for Molecular Biology, Vol 19, Iss 1, Pp 1-29 (2024)
Algorithms for Molecular Biology

Subject Terms: 0301 basic medicine, Fixed-parameter tractable algorithms, Bioinformatics, QH301-705.5, 0206 medical engineering, [SCCO.COMP]Cognitive science/Computer science, 02 engineering and technology, QH426-470, 03 medical and health sciences, 106005 Bioinformatik, [SCCO.COMP] Cognitive science/Computer science, Boltzmann sampling, Genetics, RNA sequence design, Biology (General), [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM], Pseudoknots, Research, 106045 Theoretische Biologie, Tree decomposition, RNA alignment, 106045 Theoretical biology, Network phylogeny, Bioinformatics Fixed-parameter tractable algorithms Tree decomposition Boltzmann sampling Network phylogeny RNA sequence design RNA alignment Pseudoknots, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], 106005 Bioinformatics

File Description: application/pdf

Access URL: https://pubmed.ncbi.nlm.nih.gov/38493130
https://doaj.org/article/a2492a3f7a8045d591547dfa7e014558

An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-Width

Authors: Gargano L., Rescigno A. A.

Contributors: Luisa Gargano and Adele A. Rescigno

Subject Terms: Fixed-parameter tractable algorithms, Spanning Trees, ddc:004, Modular-width, Branch vertices

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.50

Iterated Type Partitions

Authors: Cordasco, Gennaro^Aff11, Gargano, Luisa^Aff12, Rescigno, Adele A.^Aff12

Contributors: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Woeginger, Gerhard, Editorial Board Member^Aff6, Yung, Moti, Editorial Board Member^Aff7, Gąsieniec, Leszek, editor^Aff8, Klasing, Ralf, editor^Aff9, Radzik, Tomasz, editor^Aff10

Source: Combinatorial Algorithms : 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings. 12126:195-210

Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms: chordality is the key to single-exponential parameterized algorithms

Authors: Bonnet, Edouard, Brettell, Nick, Kwon, O-Joung, Marx, Dániel

Contributors: Bonnet, Édouard, Édouard Bonnet and Nick Brettell and O-joung Kwon and Dániel Marx, Herbstritt, Marc

Source: Algorithmica
12th International Symposium on Parameterized and Exact Computation (IPEC 2017)

Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Treewidth, feed-back vertex set, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Feedback Vertex Set, Chordal graph, Computer Science - Data Structures and Algorithms, treewidth, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), fixed-parameter tractable algorithms, 000 Computer science, knowledge, general works, QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, feedback vertex set, chordal graphs, Parameterized complexity, Computer Science, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], ddc:004, component order connectivity, Computer Science - Discrete Mathematics

File Description: application/pdf; text

Access URL: https://drops.dagstuhl.de/opus/volltexte/2018/8565/pdf/LIPIcs-IPEC-2017-7.pdf
http://arxiv.org/abs/1704.06757
https://hal.science/hal-01994406v1
https://eprints.mdx.ac.uk/24159/1/LIPIcs-IPEC-2017-7.pdf
https://drops.dagstuhl.de/opus/volltexte/2018/8565/pdf/LIPIcs-IPEC-2017-7.pdf
https://drops.dagstuhl.de/opus/volltexte/2018/8565/
https://paperity.org/p/160850943/generalized-feedback-vertex-set-problems-on-bounded-treewidth-graphs-chordality-is-the
https://doi.org/10.4230/LIPIcs.IPEC.2017.7
https://arxiv.org/pdf/1704.06757.pdf
https://arxiv.org/abs/1704.06757
https://link.springer.com/article/10.1007%2Fs00453-019-00579-4
https://ui.adsabs.harvard.edu/abs/2017arXiv170406757B/abstract
https://eprints.mdx.ac.uk/24159/
https://dblp.uni-trier.de/db/journals/corr/corr1704.html#BonnetBKM17
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.7
https://eprints.sztaki.hu/9568/

Finding Detours is Fixed-Parameter Tractable

Authors: Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin

Contributors: Ivona Bezáková and Radu Curticapean and Holger Dell and Fedor V. Fomin, Muscholl, A, Indyk, P, Kuhn, F, Chatzigiannakis, I

Source: SIAM Journal on Discrete Mathematics. 33:2326-2345

Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), above-guarantee parameterization, QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, 0102 computer and information sciences, 01 natural sciences, longest path, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, fixed-parameter tractable algorithms, graph minors, Computer Science - Discrete Mathematics

File Description: application/pdf; text

Access URL: https://drops.dagstuhl.de/opus/volltexte/2017/7479/pdf/LIPIcs-ICALP-2017-54.pdf
http://arxiv.org/abs/1607.07737
https://arxiv.org/pdf/1607.07737.pdf
https://www.arxiv.org/abs/1607.07737
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.54
https://eprints.sztaki.hu/9221/

Rectilinear Steiner Trees in Narrow Strips

Authors: Alkema, Henk, de Berg, Mark

Contributors: Henk Alkema and Mark de Berg

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Fixed-parameter tractable algorithms, Computer Science - Computational Geometry, 0102 computer and information sciences, ddc:004, fixed-parameter tractable algorithms, 0101 mathematics, 01 natural sciences, Computational geometry

File Description: application/pdf

Access URL: http://arxiv.org/abs/2103.08354
https://research.tue.nl/en/publications/e86580ef-27f8-4cf5-86f4-46b7abc96212
https://doi.org/10.4230/LIPIcs.SoCG.2021.9
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.9

Solving hard stable matching problems involving groups of similar agents

Authors: Meeks, Kitty ^a, Rastegari, Baharak ^{b, ⁎}

Source: In Theoretical Computer Science 6 December 2020 844:171-194

Diverse Collections in Matroids and Graphs

Authors: Fomin, Fedor V., Golovach, Petr A., Panolan, Fahad, Philip, Geevarghese, Saurabh, Saket

Contributors: Fedor V. Fomin and Petr A. Golovach and Fahad Panolan and Geevarghese Philip and Saket Saurabh

Subject Terms: Matroids, Diverse solutions, Fixed-parameter tractable algorithms

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 187, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.31

Availability: https://doi.org/10.4230/LIPIcs.STACS.2021.31
https://nbn-resolving.org/urn:nbn:de:0030-drops-136769
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.31

Backdoors to planning

Authors: Kronegger, Martin ^{a, b, ⁎}, Ordyniak, Sebastian ^{c, ⁎⁎}, Pfandler, Andreas ^{b, d, ⁎⁎⁎}

Source: In Artificial Intelligence April 2019 269:49-75

Euclidean TSP in narrow strips

Authors: Alkema, Henk, de Berg, Mark, Kisfaludi-Bak, Sándor

Contributors: Henk Alkema and Mark de Berg and Sándor Kisfaludi-Bak

Source: 36th International Symposium on Computational Geometry
Leibniz International Proceedings in Informatics

Subject Terms: Fixed-parameter tractable algorithms, Bitonic TSP, bitonic TSP, ddc:004, fixed-parameter tractable algorithms, Euclidean TSP, Computational geometry

File Description: application/pdf

Access URL: https://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-09948
https://drops.dagstuhl.de/opus/volltexte/2020/12162/
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_3266074
https://research.tue.nl/nl/publications/euclidean-tsp-in-narrow-strips
http://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-09948
https://drops.dagstuhl.de/opus/volltexte/2020/12162/pdf/LIPIcs-SoCG-2020-4.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.4
http://hdl.handle.net/21.11116/0000-0007-77A3-B
http://hdl.handle.net/21.11116/0000-0007-77A5-9
http://hdl.handle.net/21.11116/0000-0007-76E5-2

A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first betti number

Authors: Maria, Clément, Spreer, Jonathan

Source: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. :2721-2732

Availability: http://dl.acm.org/doi/10.5555/3039686.3039866

A Polynomial-Time Algorithm to Compute Turaev–Viro Invariants TV4,q of 3-Manifolds with Bounded First Betti Number

Authors: Maria, Clément, Spreer, Jonathan^{Aff2, IDs10208019094388_cor2}

Source: Foundations of Computational Mathematics: The Journal of the Society for the Foundations of Computational Mathematics. :1-22

Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number

Authors: Misra, Pranabendu, Saurabh, Saket, Sharma, Roohani, Zehavi, Meirav

Contributors: Pranabendu Misra and Saket Saurabh and Roohani Sharma and Meirav Zehavi

Subject Terms: sub-exponential fixed-parameter tractable algorithms, directed feedback arc set, directed cutwidth, optimal linear arrangement, bounded independence number digraph

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 122, 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.35

Availability: https://doi.org/10.4230/LIPIcs.FSTTCS.2018.35
https://nbn-resolving.org/urn:nbn:de:0030-drops-99341
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.35