Parameterized Complexity Through the Lens of Path Problems

Risultati finali

Drafting of Data Management Plan

Pubblicazioni

Meta-theorems for Parameterized Streaming Algorithms

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

Parameterized Approaches to Orthogonal Compaction

Autori: Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff and Meirav Zehavi
Pubblicato 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
Editore: Springer
DOI: 10.1007/978-3-031-23101-8\_8

A Framework for Approximation Schemes on Disk Graphs

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

Drawn Tree Decomposition: New Approach for Graph Drawing Problems

Autori: Siddharth Gupta and Guy Sa'ar and Meirav Zehavi
Pubblicato in: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, 2023, ISBN 978-3-95977-305-8
Editore: 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

Autori: Ioannis Koutis and Michal Wlodarczyk and Meirav Zehavi
Pubblicato in: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, 2023, ISBN 978-3-95977-305-8
Editore: 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

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

How to Make Knockout Tournaments More Popular?

Autori: Juhi Chaudhary and Hendrik Molter and Meirav Zehavi
Pubblicato in: Thirty-Eighth {AAAI} Conference on Artificial Intelligence, {AAAI} 2024, 2024
Editore: {AAAI} Press
DOI: 10.1609/AAAI.V38I9.28814

Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs

Autori: Juhi Chaudhary and Harmender Gahlawat and Michal Wlodarczyk and Meirav Zehavi
Pubblicato in: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, 2023, ISBN 978-3-95977-305-8
Editore: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023
DOI: 10.4230/LIPICS.IPEC.2023.10

Kernelization of Counting Problems

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

An ETH-Tight Algorithm for Bidirected Steiner Connectivity

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

Learning Small Decision Trees with Few Outliers: {A} Parameterized Perspective

Autori: Harmender Gahlawat and Meirav Zehavi
Pubblicato in: Thirty-Eighth {AAAI} Conference on Artificial Intelligence, {AAAI} 2024, 2024
Editore: {AAAI} Press
DOI: 10.1609/AAAI.V38I11.29098

Finding Long Directed Cycles Is Hard Even When {DFVS} Is Small or Girth Is Large

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

Collective Graph Exploration Parameterized by Vertex Cover

Autori: Siddharth Gupta and Guy Sa'ar and Meirav Zehavi
Pubblicato in: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, 2023, ISBN 978-3-95977-305-8
Editore: 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

Autori: Fedor V. Fomin and Saket Saurabh and Meirav Zehavi
Pubblicato in: pproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM, 2024, ISBN 978-3-95977-305-8
Editore: LIPIcs
DOI: 10.4230/LIPICS.APPROX/RANDOM.2024.4

Learning Small Decision Trees with Few Outliers: A Parameterized Perspective

Autori: Harmender Gahlawat, Meirav Zehavi
Pubblicato in: Proceedings of the AAAI Conference on Artificial Intelligence, Numero 38, 2024, ISSN 2374-3468
Editore: Association for the Advancement of Artificial Intelligence (AAAI)
DOI: 10.1609/AAAI.V38I11.29098

\emph{P}-Matchings Parameterized by Treewidth

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

Tournament Fixing Parameterized by Feedback Vertex Set Number Is FPT

Autori: Meirav Zehavi
Pubblicato in: Thirty-Seventh {AAAI} Conference on Artificial Intelligence, 2023, ISBN 978-1-57735-880-0
Editore: AAAI Press
DOI: 10.1609/aaai.v37i5.25728

Exact Algorithms for Clustered Planarity with Linear Saturators

Autori: Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi
Pubblicato in: 5th ISAAC 2024, 2024, ISBN 978-3-95977-354-6
Editore: LIPIcs
DOI: 10.4230/LIPICS.ISAAC.2024.24

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees

Autori: Ashwin Jacob and Diptapriyo Majumdar and Meirav Zehavi
Pubblicato in: 35th International Symposium on Algorithms and Computation, ISAAC, 2024, ISBN 978-3-95977-305-8
Editore: LIPIcs
DOI: 10.4230/LIPICS.ISAAC.2024.41

Kernelization for Spreading Points

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

On Computing Homological Hitting Sets

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

Parameterized Analysis of Bribery in Challenge the Champ Tournaments

Autori: Juhi Chaudhary and Hendrik Molter and Meirav Zehavi
Pubblicato in: Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI, 2024, ISBN 978-3-031-23100-1
Editore: ijcai.org

In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?

Autori: Pascal Kunz, Hendrik Molter and Meirav Zehavi
Pubblicato in: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, {IJCAI} 2023, 2023
Editore: ijcai.org
DOI: 10.24963/ijcai.2023/21

Parameterized Results on Acyclic Matchings with Implications for Related Problems (Conference Version)

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

Planar Disjoint Paths, Treewidth, and Kernels

Autori: Michal Wlodarczyk and Meirav Zehavi
Pubblicato in: 64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2023, 2023, ISBN 979-8-3503-1894-4
Editore: IEEE
DOI: 10.1109/FOCS57990.2023.00044

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3

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

Lossy Kernelization for (Implicit) Hitting Set Problems

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

Parameterized Analysis of the Cops and Robber Game

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

The Parameterized Complexity of Guarding Almost Convex Polygons

Autori: Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
Pubblicato in: Discrete & Computational Geometry, Numero 71, 2024, ISSN 0179-5376
Editore: Springer Science and Business Media LLC
DOI: 10.1007/S00454-023-00569-Y

Grid recognition: Classical and parameterized computational perspectives

Autori: Siddharth Gupta and Guy Sa'ar and Meirav Zehavi
Pubblicato in: Journal of Computer and System Sciences, 2023, ISSN 0022-0000
Editore: 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

Autori: Pranabendu Misra and Saket Saurabh and Roohani Sharma and Meirav Zehavi
Pubblicato in: Algorithmica, 2023, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/S00453-022-01093-W

Parameterized Study of Steiner Tree on Unit Disk Graphs

Autori: Sujoy Bhore and Paz Carmi and Sudeshna Kolay and Meirav Zehavi
Pubblicato in: Algorithmica, 2023, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/S00453-022-01020-Z

Long directed detours: Reduction to 2-Disjoint Paths

Autori: Ashwin Jacob, Michał Włodarczyk, Meirav Zehavi
Pubblicato in: Information Processing Letters, Numero 186, 2024, ISSN 0020-0190
Editore: Elsevier BV
DOI: 10.1016/J.IPL.2024.106491

Polynomial Kernel for Interval Vertex Deletion

Autori: Akanksha Agrawal and Daniel Lokshtanov and Pranabendu Misra and Saket Saurabh andMeirav Zehavi
Pubblicato in: {ACM} Trans. Algorithms, 2023, ISSN 1549-6325
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3571075

(Re)packing Equal Disks into Rectangle

Autori: Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
Pubblicato in: Discrete & Computational Geometry, Numero 72, 2024, ISSN 0179-5376
Editore: 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

Autori: Akanksha Agrawal and Daniel Lokshtanov and Pranabendu Misra and Saket Saurabh and Meirav Zehavi
Pubblicato in: Journal of Graph Theory, 2023, ISSN 1097-0118
Editore: Wiley
DOI: 10.1002/JGT.22895

Parameterized results on acyclic matchings with implications for related problems

Autori: Juhi Chaudhary, Meirav Zehavi
Pubblicato in: Journal of Computer and System Sciences, Numero 148, 2024, ISSN 0022-0000
Editore: Elsevier BV
DOI: 10.1016/J.JCSS.2024.103599

New Algorithms for Structure Informed Genome Rearrangement

Autori: Eden Ozeri and Meirav Zehavi andMichal Ziv-Ukelson
Pubblicato in: Algorithms for Molecular Biology, 2023, ISSN 1748-7188
Editore: BioMed Central
DOI: 10.1186/S13015-023-00239-X

Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity

Autori: Fahad Panolan, Saket Saurabh, Meirav Zehavi
Pubblicato in: ACM Transactions on Algorithms, Numero 20, 2024, ISSN 1549-6325
Editore: Association for Computing Machinery (ACM)
DOI: 10.1145/3648594

Risultati finali

Pubblicazioni

Condividi questa pagina Condividi questa pagina sui social network

Scarica Scarica il contenuto della pagina