Skip to main content
Go to the home page of the European Commission (opens in new window)
English English
CORDIS - EU research results
CORDIS

Parameterized Complexity Through the Lens of Path Problems

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Deliverables

Publications

Meta-theorems for Parameterized Streaming Algorithms (opens in new window)

Author(s): Daniel Lokshtanov and Pranabendu Misra and Fahad Panolan and M. S. Ramanujan and Saket Saurabh and Meirav Zehavi
Published in: Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2024, 2024, ISBN 978-1-61197-791-2
Publisher: SIAM
DOI: 10.1137/1.9781611977912

Parameterized Approaches to Orthogonal Compaction (opens in new window)

Author(s): Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff and Meirav Zehavi
Published in: {SOFSEM} 2023: Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, 2023, ISBN 978-3-031-23100-1
Publisher: Springer
DOI: 10.1007/978-3-031-23101-8\_8

A Framework for Approximation Schemes on Disk Graphs (opens in new window)

Author(s): Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue and Meirav Zehavi
Published in: Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2023, 2023, ISBN 978-1-61197-755-4
Publisher: {SIAM}
DOI: 10.1137/1.9781611977554.ch84

Drawn Tree Decomposition: New Approach for Graph Drawing Problems (opens in new window)

Author(s): Siddharth Gupta and Guy Sa'ar and Meirav Zehavi
Published in: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, 2023, ISBN 978-3-95977-305-8
Publisher: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023
DOI: 10.4230/LIPICS.IPEC.2023.23

Sidestepping Barriers for Dominating Set in Parameterized Complexity (opens in new window)

Author(s): Ioannis Koutis and Michal Wlodarczyk and Meirav Zehavi
Published in: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, 2023, ISBN 978-3-95977-305-8
Publisher: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023
DOI: 10.4230/LIPICS.IPEC.2023.31

A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs (opens in new window)

Author(s): Daniel Lokshtanov and Fahad Panolan and Saket Saurabh and Jie Xue and Meirav Zehavi
Published in: 40th International Symposium on Computational Geometry, SoCG 2024, 2024, ISBN 978-3-95977-316-4
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/LIPICS.SOCG.2024.72

How to Make Knockout Tournaments More Popular? (opens in new window)

Author(s): Juhi Chaudhary and Hendrik Molter and Meirav Zehavi
Published in: Thirty-Eighth {AAAI} Conference on Artificial Intelligence, {AAAI} 2024, 2024
Publisher: {AAAI} Press
DOI: 10.1609/AAAI.V38I9.28814

Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs (opens in new window)

Author(s): Juhi Chaudhary and Harmender Gahlawat and Michal Wlodarczyk and Meirav Zehavi
Published in: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, 2023, ISBN 978-3-95977-305-8
Publisher: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023
DOI: 10.4230/LIPICS.IPEC.2023.10

Kernelization of Counting Problems (opens in new window)

Author(s): Daniel Lokshtanov and Pranabendu Misra and Saket Saurabh and Meirav Zehavi
Published in: 15th Innovations in Theoretical Computer Science Conference, {ITCS} 2024, 2024, ISBN 978-3-95977-309-6
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/LIPICS.ITCS.2024.77

An ETH-Tight Algorithm for Bidirected Steiner Connectivity (opens in new window)

Author(s): Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh and Meirav Zehavi
Published in: Algorithms and Data Structures - 18th International Symposium, {WADS} 2023, 2023, ISBN 978-3-031-38905-4
Publisher: Springer
DOI: 10.1007/978-3-031-38906-1

Learning Small Decision Trees with Few Outliers: {A} Parameterized Perspective (opens in new window)

Author(s): Harmender Gahlawat and Meirav Zehavi
Published in: Thirty-Eighth {AAAI} Conference on Artificial Intelligence, {AAAI} 2024, 2024
Publisher: {AAAI} Press
DOI: 10.1609/AAAI.V38I11.29098

Finding Long Directed Cycles Is Hard Even When {DFVS} Is Small or Girth Is Large (opens in new window)

Author(s): Ashwin Jacob, Michal Wlodarczyk and Meirav Zehavi
Published in: 31st Annual European Symposium on Algorithms, {ESA} 2023, 2023, ISBN 978-3-95977-295-2
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/LIPIcs.ESA.2023.65

Collective Graph Exploration Parameterized by Vertex Cover (opens in new window)

Author(s): Siddharth Gupta and Guy Sa'ar and Meirav Zehavi
Published in: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, 2023, ISBN 978-3-95977-305-8
Publisher: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023
DOI: 10.4230/LIPICS.IPEC.2023.22

Hybrid k-Clustering: Blending k-Median and k-Center (opens in new window)

Author(s): Fedor V. Fomin and Saket Saurabh and Meirav Zehavi
Published in: pproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM, 2024, ISBN 978-3-95977-305-8
Publisher: LIPIcs
DOI: 10.4230/LIPICS.APPROX/RANDOM.2024.4

Learning Small Decision Trees with Few Outliers: A Parameterized Perspective (opens in new window)

Author(s): Harmender Gahlawat, Meirav Zehavi
Published in: Proceedings of the AAAI Conference on Artificial Intelligence, Issue 38, 2024, ISSN 2374-3468
Publisher: Association for the Advancement of Artificial Intelligence (AAAI)
DOI: 10.1609/AAAI.V38I11.29098

\emph{P}-Matchings Parameterized by Treewidth (opens in new window)

Author(s): Juhi Chaudhary and Meirav Zehavi
Published in: Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, 2023, ISBN 978-3-031-43379-5
Publisher: Springer
DOI: 10.1007/978-3-031-43380-1\_16

Tournament Fixing Parameterized by Feedback Vertex Set Number Is FPT (opens in new window)

Author(s): Meirav Zehavi
Published in: Thirty-Seventh {AAAI} Conference on Artificial Intelligence, 2023, ISBN 978-1-57735-880-0
Publisher: AAAI Press
DOI: 10.1609/aaai.v37i5.25728

Exact Algorithms for Clustered Planarity with Linear Saturators (opens in new window)

Author(s): Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi
Published in: 5th ISAAC 2024, 2024, ISBN 978-3-95977-354-6
Publisher: LIPIcs
DOI: 10.4230/LIPICS.ISAAC.2024.24

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees (opens in new window)

Author(s): Ashwin Jacob and Diptapriyo Majumdar and Meirav Zehavi
Published in: 35th International Symposium on Algorithms and Computation, ISAAC, 2024, ISBN 978-3-95977-305-8
Publisher: LIPIcs
DOI: 10.4230/LIPICS.ISAAC.2024.41

Kernelization for Spreading Points (opens in new window)

Author(s): Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh and Meirav Zehavi
Published in: 31st Annual European Symposium on Algorithms, {ESA} 2023, 2023, ISBN 978-3-95977-295-2
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/LIPIcs.ESA.2023.48

On Computing Homological Hitting Sets (opens in new window)

Author(s): Ulrich Bauer, Abhishek Rathod and Meirav Zehavi
Published in: 14th Innovations in Theoretical Computer Science Conference, {ITCS} 2023, 2023, ISBN 978-3-95977-263-1
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/LIPIcs.ITCS.2023.13

Parameterized Analysis of Bribery in Challenge the Champ Tournaments

Author(s): Juhi Chaudhary and Hendrik Molter and Meirav Zehavi
Published in: Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI, 2024, ISBN 978-3-031-23100-1
Publisher: ijcai.org

In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? (opens in new window)

Author(s): Pascal Kunz, Hendrik Molter and Meirav Zehavi
Published in: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, {IJCAI} 2023, 2023
Publisher: ijcai.org
DOI: 10.24963/ijcai.2023/21

Parameterized Results on Acyclic Matchings with Implications for Related Problems (Conference Version) (opens in new window)

Author(s): Juhi Chaudhary and Meirav Zehavi
Published in: Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, 2023, ISBN 978-3-031-43379-5
Publisher: Springer
DOI: 10.1007/978-3-031-43380-1\_15

Planar Disjoint Paths, Treewidth, and Kernels (opens in new window)

Author(s): Michal Wlodarczyk and Meirav Zehavi
Published in: 64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2023, 2023, ISBN 979-8-3503-1894-4
Publisher: IEEE
DOI: 10.1109/FOCS57990.2023.00044

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3 (opens in new window)

Author(s): Daniel Lokshtanov and Fahad Panolan and Saket Saurabh and Jie Xue and Meirav Zehavi
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM, 2024, ISBN 978-3-95977-305-8
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/LIPICS.APPROX/RANDOM.2024.6

Lossy Kernelization for (Implicit) Hitting Set Problems (opens in new window)

Author(s): Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stephan Thomasse and Meirav Zehavi
Published in: 31st Annual European Symposium on Algorithms, {ESA} 2023, 2023, ISBN 978-3-95977-295-2
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/LIPIcs.ESA.2023.49

Parameterized Analysis of the Cops and Robber Game (opens in new window)

Author(s): Harmender Gahlawat and Meirav Zehavi
Published in: 48th International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2023, 2023, ISBN 978-3-95977-292-1
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/LIPIcs.MFCS.2023.49

The Parameterized Complexity of Guarding Almost Convex Polygons (opens in new window)

Author(s): Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
Published in: Discrete & Computational Geometry, Issue 71, 2024, ISSN 0179-5376
Publisher: Springer Science and Business Media LLC
DOI: 10.1007/S00454-023-00569-Y

Grid recognition: Classical and parameterized computational perspectives (opens in new window)

Author(s): Siddharth Gupta and Guy Sa'ar and Meirav Zehavi
Published in: Journal of Computer and System Sciences, 2023, ISSN 0022-0000
Publisher: Academic Press
DOI: 10.1016/J.JCSS.2023.02.008

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number (opens in new window)

Author(s): Pranabendu Misra and Saket Saurabh and Roohani Sharma and Meirav Zehavi
Published in: Algorithmica, 2023, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/S00453-022-01093-W

Parameterized Study of Steiner Tree on Unit Disk Graphs (opens in new window)

Author(s): Sujoy Bhore and Paz Carmi and Sudeshna Kolay and Meirav Zehavi
Published in: Algorithmica, 2023, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/S00453-022-01020-Z

Long directed detours: Reduction to 2-Disjoint Paths (opens in new window)

Author(s): Ashwin Jacob, Michał Włodarczyk, Meirav Zehavi
Published in: Information Processing Letters, Issue 186, 2024, ISSN 0020-0190
Publisher: Elsevier BV
DOI: 10.1016/J.IPL.2024.106491

Polynomial Kernel for Interval Vertex Deletion (opens in new window)

Author(s): Akanksha Agrawal and Daniel Lokshtanov and Pranabendu Misra and Saket Saurabh andMeirav Zehavi
Published in: {ACM} Trans. Algorithms, 2023, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3571075

(Re)packing Equal Disks into Rectangle (opens in new window)

Author(s): Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
Published in: Discrete & Computational Geometry, Issue 72, 2024, ISSN 0179-5376
Publisher: Springer Science and Business Media LLC
DOI: 10.1007/S00454-024-00633-1

Erd{\H{o}}s-P{\'{o}}sa property of obstructions to interval graphs (opens in new window)

Author(s): Akanksha Agrawal and Daniel Lokshtanov and Pranabendu Misra and Saket Saurabh and Meirav Zehavi
Published in: Journal of Graph Theory, 2023, ISSN 1097-0118
Publisher: Wiley
DOI: 10.1002/JGT.22895

Parameterized results on acyclic matchings with implications for related problems (opens in new window)

Author(s): Juhi Chaudhary, Meirav Zehavi
Published in: Journal of Computer and System Sciences, Issue 148, 2024, ISSN 0022-0000
Publisher: Elsevier BV
DOI: 10.1016/J.JCSS.2024.103599

New Algorithms for Structure Informed Genome Rearrangement (opens in new window)

Author(s): Eden Ozeri and Meirav Zehavi andMichal Ziv-Ukelson
Published in: Algorithms for Molecular Biology, 2023, ISSN 1748-7188
Publisher: BioMed Central
DOI: 10.1186/S13015-023-00239-X

Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity (opens in new window)

Author(s): Fahad Panolan, Saket Saurabh, Meirav Zehavi
Published in: ACM Transactions on Algorithms, Issue 20, 2024, ISSN 1549-6325
Publisher: Association for Computing Machinery (ACM)
DOI: 10.1145/3648594

Searching for OpenAIRE data...

There was an error trying to search data from OpenAIRE

No results available

My booklet 0 0