E-LIB Suche - Ergebnisse für: Rabinovich, Roman

1

The Treewidth and Pathwidth of Graph Unions:

Alecu, Bogdan ; Lozin, Vadim V. ; Quiroz, Daniel A....
SIAM Journal on Discrete Mathematics. 38 (2024) 1 - p. 261-276 , 2024

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

2

Preface to the special issue on Graph Searching: Theory and..:

Angelopoulos, Spyros ; Clarke, Nancy E. ; Fomin, Fedor V...
Theoretical Computer Science. 858 (2021) - p. 145-146 , 2021

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

3

Rankwidth meets stability:

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

Nešetřil, Jaroslav ; Mendez, Patrice Ossona de ; Pilipczuk, Michał.. - p. 2014-2033 , 2021

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

4

Rankwidth meets stability:

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

Nešetřil, Jaroslav ; de Mendez, Patrice Ossona ; Pilipczuk, Michał.. - p. 2014-2033 , 2021

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

5

Classes of graphs with low complexity: The case of classes ..:

Nešetřil, Jaroslav ; Ossona de Mendez, Patrice ; Rabinovich, Roman.
European Journal of Combinatorics. 91 (2021) - p. 103223 , 2021

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

6

Model-Checking on Ordered Structures:

Eickmeyer, Kord ; Heuvel, Jan van den ; Kawarabayashi, Ken-Ichi...
ACM Transactions on Computational Logic. 21 (2020) 2 - p. 1-28 , 2020

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

7

Linear rankwidth meets stability:

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

Nešetřil, Jaroslav ; de Mendez, Patrice Ossona ; Rabinovich, Roman. - p. 1180-1199 , 2020

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

8

Model-Checking on Ordered Structures:

Eickmeyer, Kord ; Heuvel, Jan van den ; Kawarabayashi, Ken-Ichi...
ACM Transactions on Computational Logic (TOCL). 21 (2020) 2 - p. 1-28 , 2020

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

9

CoBe - Coded Beacons for Localization, Object Tracking, and..:

, In: 2020 IEEE 16th International Conference on Automation Science and Engineering (CASE),

Rabinovich, Roman ; Jubran, Ibrahim ; Wetzler, Aaron. - p. 1367-1374 , 2020

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

10

Empirical Evaluation of Approximation Algorithms for Genera..:

Nadara, Wojciech ; Pilipczuk, Marcin ; Rabinovich, Roman..
ACM Journal of Experimental Algorithmics. 24 (2019) - p. 1-34 , 2019

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

11

Cyclewidth and the Grid Theorem for Perfect Matching Width ..:

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

Hatzel, Meike ; Rabinovich, Roman ; Wiederrecht, Sebastian - p. 53-65 , 2019

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

12

Empirical Evaluation of Approximation Algorithms for Genera..:

Nadara, Wojciech ; Pilipczuk, Marcin ; Rabinovich, Roman..
Journal of Experimental Algorithmics (JEA). 24 (2019) 24 - p. 1-34 , 2019

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

13

Routing with congestion in acyclic digraphs:

Akhoondian Amiri, Saeed ; Kreutzer, Stephan ; Marx, Dániel.
Information Processing Letters. 151 (2019) - p. 105836 , 2019

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

14

Polynomial Kernels and Wideness Properties of Nowhere Dense..:

Kreutzer, Stephan ; Rabinovich, Roman ; Siebertz, Sebastian
ACM Transactions on Algorithms. 15 (2018) 2 - p. 1-19 , 2018

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

15

Coloring and Covering Nowhere Dense Graphs:

Grohe, Martin ; Kreutzer, Stephan ; Rabinovich, Roman..
SIAM Journal on Discrete Mathematics. 32 (2018) 4 - p. 2467-2481 , 2018

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