Robert Ganian

	2012
17		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: 326-337
16		Robert Ganian: Using Neighborhood Diversity to Solve Hard Problems CoRR abs/1201.3091: (2012)
	2011
15		Robert Ganian: Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics. IPEC 2011: 259-271
14		Robert Ganian: New Results on the Complexity of the Max- and Min-Rep Problems. SOFSEM 2011: 238-247
13		Robert Ganian, Petr Hlinený, Jan Obdrzálek: Clique-width: When Hard Does Not Mean Impossible. STACS 2011: 404-415
12		Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Lower Bounds on the Complexity of MSO1 Model-Checking CoRR abs/1109.5804: (2011)
	2010
11		Robert Ganian, Petr Hlinený, Jan Obdrzálek: Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. FSTTCS 2010: 73-83
10		Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Are There Any Good Digraph Width Measures? IPEC 2010: 135-146
9		Robert Ganian: Thread Graphs, Linear Rank-Width and Their Algorithmic Applications. IWOCA 2010: 38-42
8		Robert Ganian, Petr Hlinený: New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes. SOFSEM 2010: 428-439
7		Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Are there any good digraph width measures? CoRR abs/1004.1485: (2010)
6		Robert Ganian, Petr Hlinený, Jan Obdrzálek: Better algorithms for satisfiability problems for formulas of bounded rank-width CoRR abs/1006.5621: (2010)
5		Robert Ganian, Petr Hlinený: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Discrete Applied Mathematics 158(7): 851-867 (2010)
	2009
4		Robert Ganian, Petr Hlinený: Better Polynomial Algorithms on Graphs of Bounded Rank-Width. IWOCA 2009: 266-277
3		Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith: On Digraph Width Measures in Parameterized Algorithmics. IWPEC 2009: 185-197
2		Robert Ganian: The Parameterized Complexity of Oriented Colouring. MEMICS 2009
	2008
1		Petr Hlinený, Robert Ganian: Automata approach to graphs of bounded rank-width. IWOCA 2008: 4-15

Coauthor Index

1	Petr Hlinený	[1] [3] [4] [5] [6] [7] [8] [10] [11] [12] [13] [17]
2	Joachim Kneis	[3] [7] [10]
3	Alexander Langer	[3] [12] [17]
4	Daniel Meister	[7] [10]
5	Jan Obdrzálek	[3] [6] [7] [10] [11] [12] [13] [17]
6	Peter Rossmanith	[3] [7] [10] [12] [17]
7	Somnath Sikdar	[7] [10] [12] [17]

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page