|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2 occurrences of 2 keywords
|
|
|
|
|
Results
Found 17 publication records. Showing 17 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Robert Ganian |
Using Neighborhood Diversity to Solve Hard Problems  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Lower Bounds on the Complexity of MSO_1 Model-Checking. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Lower Bounds on the Complexity of MSO1 Model-Checking |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Robert Ganian |
Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics. |
IPEC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Jan Obdrzálek |
Clique-width: When Hard Does Not Mean Impossible. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian |
New Results on the Complexity of the Max- and Min-Rep Problems. |
SOFSEM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Jan Obdrzálek |
Better algorithms for satisfiability problems for formulas of bounded rank-width |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Are there any good digraph width measures? |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený |
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Are There Any Good Digraph Width Measures? |
IPEC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený |
New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes. |
SOFSEM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian |
Thread Graphs, Linear Rank-Width and Their Algorithmic Applications. |
IWOCA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Jan Obdrzálek |
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith |
On Digraph Width Measures in Parameterized Algorithmics. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian |
The Parameterized Complexity of Oriented Colouring. |
MEMICS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený |
Better Polynomial Algorithms on Graphs of Bounded Rank-Width. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
Rank-width, rank-decomposition, chromatic polynomial, Hamiltonian path, chromatic number |
| 1 | Petr Hlinený, Robert Ganian |
Automata approach to graphs of bounded rank-width. |
IWOCA |
2008 |
DBLP BibTeX RDF |
|
Displaying result #1 - #17 of 17 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")