| Body na spoluautora | Body za publikaci pro MU | Odkaz ISVaV | | 4,82 | 14,45 | On Digraph Width Measures in Parameterized Algorithmics
|
| 0,00 | 0,00 | Automata Approach to Graphs of Bounded Rank-width
|
| 0,00 | 0,00 | Automata Approach to Graphs of Bounded Rank-width
|
| 42,06 | 42,06 | Bridging Separations in Matroids
|
| 33,45 | 33,45 | A Parametrized Algorithm for Matroid Branch-Width
|
| 56,66 | 56,66 | Finding branch-decomposition and rank-decomposition
|
| 12,32 | 12,32 | Computing the Tutte Polynomial on Graphs of Bounded Clique-Width
|
| 14,45 | 14,45 | Computing the Tutte Polynomial on Graphs of Bounded Clique-Width (extended abstract)
|
| 0,00 | 0,00 | Computing the Tutte Polynomial on Graphs of Bounded Clique-Width (extended abstract)
|
| 0,00 | 0,00 | Combinatorial Generation of Matroid Representations: Theory and Practice
|
| 16,73 | 16,73 | Equivalence-free exhaustive generation of matroid representations
|
| 36,26 | 36,26 | Crossing Number is Hard for Cubic Graphs
|
| 16,11 | 16,11 | Computing the Tutte Polynomial on Graphs of Bounded Clique-Width
|
| 33,93 | 33,93 | Matroid Tree-Width
|
| 14,45 | 14,45 | On Matroid Representability and Minor Problems
|
| 0,00 | 0,00 | On Matroid Representability and Minor Problems
|
| 20,81 | 20,81 | New infinite families of almost-planar crossing-critical graphs
|
| 30,19 | 30,19 | Stars and Bonds in Crossing-Critical Graphs
|
| 0,00 | 0,00 | Stars and Bonds in Crossing-Critical Graphs
|
| 0,00 | 0,00 | 20 years of Negami's planar cover conjecture
|
| 0,00 | 0,00 | Combinatorial Generation of Matroid Representations: Theory and Practice
|
| 10,06 | 10,06 | The crossing number of a projective graph is quadratic in the face--width (Extended abstract)
|
| 14,45 | 14,45 | Approximating the Crossing Number of Toroidal Graphs
|
| 14,45 | 14,45 | Finding branch-decomposition and rank-decomposition (Extended abstract)
|
| 20,81 | 20,81 | The crossing number of a projective graph is quadratic in the face--width
|
| 45,31 | 45,31 | Addendum to Matroid Tree-Width
|
| 7,22 | 14,45 | Better Polynomial Algorithms on Graphs of Bounded Rank-width.
|
| 14,45 | 14,45 | Approximating the Crossing Number of Apex Graphs (poster)
|
| 30,19 | 30,19 | On the Crossing Number of Almost Planar Graphs
|
| 14,45 | 14,45 | On the Crossing Number of Almost Planar Graphs
|
| 15,52 | 15,52 | Some Hard Problems on Matroid Spikes
|
| 15,08 | 15,08 | The Tutte Polynomial for Matroids of Bounded Branch-Width
|
| 8,86 | 8,86 | Trees, grids, and MSO decidability: From graphs to matroids
|
| 36,26 | 36,26 | Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids
|
| 30,16 | 30,16 | Balanced Signings and the Chromatic Number of Oriented Matroids
|
| 24,48 | 24,48 | Width Parameters Beyond Tree-width and Their Applications
|
Back
(c) Michal Bulant, 2011