E-LIB Suche - Ergebnisse für: Zehavi, Meirav

1

New parameterized algorithms for matching and packing probl..:

Koana, Tomohiro , 2024

Link: https://nbn-resolving.de..

2

(Re)packing Equal Disks into Rectangle:

Fomin, Fedor V. ; Golovach, Petr A. ; Inamdar, Tanmay..
Discrete & Computational Geometry. , 2024

Link: https://doi.org/10.1007/..

3

Long directed detours: Reduction to 2-Disjoint Paths:

Jacob, Ashwin ; Włodarczyk, Michał ; Zehavi, Meirav
Information Processing Letters. 186 (2024) - p. 106491 , 2024

Link: https://doi.org/10.1016/..

4

Contraction Decomposition in Unit Disk Graphs and Algorithm..:

Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav
ACM Transactions on Algorithms. 20 (2024) 2 - p. 1-50 , 2024

Link: https://doi.org/10.1145/..

5

Kernelization of Counting Problems:

Lokshtanov, Daniel ; Misra, Pranabendu ; Saurabh, Saket.
Is Part Of LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). , 2024

Link: https://doi.org/10.4230/..

6

Parameterized complexity of multi-node hubs:

Saurabh, Saket ; Zehavi, Meirav
Journal of Computer and System Sciences. 131 (2023) - p. 64-85 , 2023

Link: https://doi.org/10.1016/..

7

New algorithms for structure informed genome rearrangement:

Ozeri, Eden ; Zehavi, Meirav ; Ziv-Ukelson, Michal
Algorithms for Molecular Biology. 18 (2023) 1 - p. , 2023

Link: https://doi.org/10.1186/..

8

An ETH-Tight Algorithm for Bidirected Steiner Connectivity:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,

Lokshtanov, Daniel ; Misra, Pranabendu ; Panolan, Fahad.. - p. 588-604 , 2023

Link: https://doi.org/10.1007/..

9

Forgetfulness Can Make You Faster: AnO*(8.097k)-time Algori..:

Zehavi, Meirav
ACM Transactions on Computation Theory. 15 (2023) 3-4 - p. 1-13 , 2023

Link: https://doi.org/10.1145/..

10

$$\mathcal {P}$$-Matchings Parameterized by Treewidth:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Chaudhary, Juhi ; Zehavi, Meirav - p. 217-231 , 2023

Link: https://doi.org/10.1007/..

11

Polynomial Kernel for Interval Vertex Deletion:

Agrawal, Akanksha ; Lokshtanov, Daniel ; Misra, Pranabendu..
ACM Transactions on Algorithms. 19 (2023) 2 - p. 1-68 , 2023

Link: https://doi.org/10.1145/..

12

Sub-exponential Time Parameterized Algorithms for Graph Lay..:

Misra, Pranabendu ; Saurabh, Saket ; Sharma, Roohani.
Algorithmica. 85 (2023) 7 - p. 2065-2086 , 2023

Link: https://doi.org/10.1007/..

13

Planar Disjoint Paths, Treewidth, and Kernels:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),

Wlodarczyk, Michal ; Zehavi, Meirav - p. 649-662 , 2023

Link: https://doi.org/10.1109/..

14

Parameterized Approaches to Orthogonal Compaction:

, In: Lecture Notes in Computer Science; SOFSEM 2023: Theory and Practice of Computer Science,

Didimo, Walter ; Gupta, Siddharth ; Kindermann, Philipp... - p. 111-125 , 2023

Link: https://doi.org/10.1007/..

15

The Parameterized Complexity of Guarding Almost Convex Poly..:

Agrawal, Akanksha ; Knudsen, Kristine V. K. ; Lokshtanov, Daniel..
Discrete & Computational Geometry. 71 (2023) 2 - p. 358-398 , 2023

Link: https://doi.org/10.1007/..