Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Razgon, Igor
70  Ergebnisse:
Personensuche X
?
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

Fractional covers of hypergraphs with bounded multi-interse..:

Gottlob, Georg ; Lanzinger, Matthias ; Pichler, Reinhard.
Theoretical Computer Science.  979 (2023)  - p. 114204 , 2023
Link: https://doi.org/10.1016/..
 
?
3

New Width Parameters for Independent Set: One-Sided-Mim-Wid..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Bergougnoux, Benjamin ; Korhonen, Tuukka ; Razgon, Igor - p. 72-85 , 2023
Link: https://doi.org/10.1007/..
 
?
4

Tree-width dichotomy:

Lozin, Vadim ; Razgon, Igor
European Journal of Combinatorics.  103 (2022)  - p. 103517 , 2022
Link: https://doi.org/10.1016/..
 
?
5

Complexity Analysis of Generalized and Fractional Hypertree..:

Gottlob, Georg ; Lanzinger, Matthias ; Pichler, Reinhard.
Journal of the ACM (JACM).  68 (2021)  5 - p. 1-50 , 2021
Link: https://dl.acm.org/doi/1..
 
?
6

Complexity Analysis of Generalized and Fractional Hypertree..:

Gottlob, Georg ; Lanzinger, Matthias ; Pichler, Reinhard.
Journal of the ACM.  68 (2021)  5 - p. 1-50 , 2021
Link: https://doi.org/10.1145/..
 
?
7

Well-quasi-ordering versus clique-width:

Lozin, Vadim ; Razgon, Igor ; Zamaraev, Viktor
Journal of Combinatorial Theory, Series B.  130 (2018)  - p. 1-18 , 2018
Link: https://doi.org/10.1016/..
 
?
8

Linear read-once and related Boolean functions:

Lozin, Vadim ; Razgon, Igor ; Zamaraev, Viktor..
Discrete Applied Mathematics.  250 (2018)  - p. 16-27 , 2018
Link: https://doi.org/10.1016/..
 
?
9

On Oblivious Branching Programs with Bounded Repetition tha..:

Razgon, Igor
Theory of Computing Systems.  61 (2016)  3 - p. 755-776 , 2016
Link: https://doi.org/10.1007/..
 
?
10

On the Read-Once Property of Branching Programs and CNFs of..:

Razgon, Igor
Algorithmica.  75 (2015)  2 - p. 277-294 , 2015
Link: https://doi.org/10.1007/..
 
?
11

Fixed-Parameter Tractability of Multicut Parameterized by t..:

Marx, Dániel ; Razgon, Igor
SIAM Journal on Computing.  43 (2014)  2 - p. 355-388 , 2014
Link: https://doi.org/10.1137/..
 
?
12

Finding small separators in linear time via treewidth reduc..:

Marx, Dáaniel ; O'sullivan, Barry ; Razgon, Igor
ACM Transactions on Algorithms (TALG).  9 (2013)  4 - p. 1-35 , 2013
Link: https://dl.acm.org/doi/1..
 
?
13

Finding small separators in linear time via treewidth reduc..:

Marx, Dáaniel ; O'sullivan, Barry ; Razgon, Igor
ACM Transactions on Algorithms.  9 (2013)  4 - p. 1-35 , 2013
Link: https://doi.org/10.1145/..
 
?
14

Boundary Properties of Well-Quasi-Ordered Sets of Graphs:

Korpelainen, Nicholas ; Lozin, Vadim V. ; Razgon, Igor
Order.  30 (2012)  3 - p. 723-735 , 2012
Link: https://doi.org/10.1007/..
 
?
15

Fixed-parameter tractability of multicut parameterized by t..:

, In: Proceedings of the forty-third annual ACM symposium on Theory of computing,
Marx, Dániel ; Razgon, Igor - p. 469-478 , 2011
Link: https://dl.acm.org/doi/1..
 
1-15