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

1

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

2

$$\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/..

3

Parameterized Results on Acyclic Matchings with Implication..:

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

Chaudhary, Juhi ; Zehavi, Meirav - p. 201-216 , 2023

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

4

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

5

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

6

FPT-approximation for FPT Problems:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),

Lokshtanov, Daniel ; Misra, Pranabendu ; Ramanujan, M. S... - p. 199-218 , 2021

Link: https://doi.org/10.1137/..

7

Efficient computation of representative weight functions wi..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,

Lokshtanov, Daniel ; Saurabh, Saket ; Zehavi, Meirav - p. 179-198 , 2021

Link: https://dl.acm.org/doi/1..

8

Multivariate Analysis of Scheduling Fair Competitions:

, In: Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems,

Gupta, Siddharth ; Zehavi, Meirav - p. 555-564 , 2021

Link: https://dl.acm.org/doi/1..

9

Verification of Multi-layered Assignment Problems:

, In: Multi-Agent Systems; Lecture Notes in Computer Science,

Steindl, Barak ; Zehavi, Meirav - p. 194-210 , 2021

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

10

FPT-approximation for FPT problems:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,

Lokshtanov, Daniel ; Misra, Pranabendu ; Ramanujan, M. S... - p. 199-218 , 2021

Link: https://dl.acm.org/doi/1..

11

Parameterized Analysis of Assignment Under Multiple Prefere..:

, In: Multi-Agent Systems; Lecture Notes in Computer Science,

Steindl, Barak ; Zehavi, Meirav - p. 160-177 , 2021

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

12

Efficient Computation of Representative Weight Functions wi..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),

Lokshtanov, Daniel ; Saurabh, Saket ; Zehavi, Meirav - p. 179-198 , 2021

Link: https://doi.org/10.1137/..

13

Efficient Graph Minors Theory and Parameterized Algorithms ..:

, In: Treewidth, Kernels, and Algorithms; Lecture Notes in Computer Science,

Lokshtanov, Daniel ; Saurabh, Saket ; Zehavi, Meirav - p. 112-128 , 2020

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

14

Parameterized Analysis of Art Gallery and Terrain Guarding:

, In: Computer Science – Theory and Applications; Lecture Notes in Computer Science,

Agrawal, Akanksha ; Zehavi, Meirav - p. 16-29 , 2020

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

15

Graph Hamiltonicity Parameterized by Proper Interval Deleti..:

, In: LATIN 2020: Theoretical Informatics; Lecture Notes in Computer Science,

Golovach, Petr A. ; Krithika, R. ; Sahu, Abhishek.. - p. 104-115 , 2020

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