The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Robert Ganian" ( http://dblp.L3S.de/Authors/Robert_Ganian )

URL (Homepage):  https://orcid.org/0000-0002-7762-8045  Author page on DBLP  Author page in RDF  Community of Robert Ganian in ASPL-2

Publication years (Num. hits)
2008-2011 (15) 2012-2014 (16) 2015-2016 (30) 2017-2018 (28) 2019 (16)
Publication types (Num. hits)
article(52) inproceedings(53)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2 occurrences of 2 keywords

Results
Found 106 publication records. Showing 105 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Eduard Eiben, Robert Ganian, K. Kangas, Sebastian Ordyniak Counting Linear Extensions: Parameterizations by Treewidth. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa 0001 Parameterized Complexity of Asynchronous Border Minimization. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan On the Complexity Landscape of Connected f-Factor Problems. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak, Stefan Szeider A Join-Based Hybrid Parameter for Constraint Satisfaction. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider On Clustering Incomplete Data. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg On Strict (Outer-)Confluent Graphs. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg Parameterized Algorithms for Book Embedding Problems. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez Shrub-depth: Capturing Height of Dense Graphs. Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2019 DBLP  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna Integer Programming and Incidence Treedepth. Search on Bibsonomy IPCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak, C. S. Rahul Group Activity Selection with Few Agent Types. Search on Bibsonomy ESA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak The Power of Cut-Based Parameters for Computing Edge Disjoint Paths. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak Solving Integer Quadratic Programming via Explicit and Structural Restrictions. Search on Bibsonomy AAAI The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider SAT-Encodings for Treecut Width and Treedepth. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak, Stefan Szeider A Join-Based Hybrid Parameter for Constraint Satisfaction. Search on Bibsonomy CP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak The complexity landscape of decompositional parameters for ILP. Search on Bibsonomy Artif. Intell. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Stefan Szeider Solving Problems on Graphs of High Rank-Width. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, O-joung Kwon A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak, C. S. Rahul Group Activity Selection with Few Agent Types. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak The Complexity Landscape of Decompositional Parameters for ILP. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak The Power of Cut-Based Parameters for Computing Edge Disjoint Paths. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan On the Complexity Landscape of Connected f -Factor Problems. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider Parameterized Algorithms for the Matrix Completion Problem. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Juho Lauri On the complexity of rainbow coloring problems. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Stefan Szeider Meta-kernelization using well-structured modulators. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Sebastian Ordyniak Small Resolution Proofs for QBF using Dependency Treewidth. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Fabian Klute, Sebastian Ordyniak On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Eun Jung Kim 0002, Friedrich Slivovsky, Stefan Szeider Sum-of-Products with Default Values: Algorithms and Complexity Results. Search on Bibsonomy ICTAI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider Parameterized Algorithms for the Matrix Completion Problem. Search on Bibsonomy ICML The full citation details ... 2018 DBLP  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Sebastian Ordyniak A Structural Approach to Activity Selection. Search on Bibsonomy IJCAI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak Unary Integer Linear Programming with Structural Restrictions. Search on Bibsonomy IJCAI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Robert Ganian, M. S. Ramanujan, Stefan Szeider Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez Shrub-depth: Capturing Height of Dense Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan On Structural Parameterizations of the Edge Disjoint Paths Problem. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Sebastian Ordyniak Small Resolution Proofs for QBF using Dependency Treewidth. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak, Ramanujan Sridharan On Structural Parameterizations of the Edge Disjoint Paths Problem. Search on Bibsonomy ISAAC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan Towards a Polynomial Kernel for Directed Feedback Vertex Set. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan Going Beyond Primal Treewidth for (M)ILP. Search on Bibsonomy AAAI The full citation details ... 2017 DBLP  BibTeX  RDF
1Robert Ganian, Stefan Szeider New Width Parameters for Model Counting. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Robert Ganian, M. S. Ramanujan, Stefan Szeider Backdoor Treewidth for SAT. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Robert Ganian, M. S. Ramanujan, Stefan Szeider Combining Treewidth and Backdoors for CSP. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. Search on Bibsonomy IJCAI The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Simone Bova, Robert Ganian, Stefan Szeider Model Checking Existential Logic on Partially Ordered Sets. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Simone Bova, Robert Ganian, Stefan Szeider Quantified conjunctive queries on partially ordered sets. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Friedrich Slivovsky, Stefan Szeider Meta-kernelization with structural parameters. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Ganian, M. S. Ramanujan, Stefan Szeider Backdoors to Tractable Valued CSP. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Robert Ganian, M. S. Ramanujan, Stefan Szeider Combining Treewidth and Backdoors for CSP. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Eduard Eiben, Robert Ganian, O-joung Kwon A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister 0001, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar Are there any good digraph width measures? Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Ganian, M. S. Ramanujan, Stefan Szeider Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. Search on Bibsonomy SODA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Kustaa Kanga, Sebastian Ordyniak Counting Linear Extensions: Parameterizations by Treewidth. Search on Bibsonomy ESA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan On the Complexity Landscape of Connected f-Factor Problems. Search on Bibsonomy MFCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, O-joung Kwon A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion. Search on Bibsonomy MFCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Ronald de Haan, Iyad A. Kanj, Stefan Szeider On Existential MSO and its Relation to ETH. Search on Bibsonomy MFCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff Polynomial-Time Construction of Optimal MPI Derived Datatype Trees. Search on Bibsonomy IPDPS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak The Complexity Landscape of Decompositional Parameters for ILP. Search on Bibsonomy AAAI The full citation details ... 2016 DBLP  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Sebastian Ordyniak Using Decomposition-Parameters for QBF: Mind the Prefix! Search on Bibsonomy AAAI The full citation details ... 2016 DBLP  BibTeX  RDF
1Robert Ganian, M. S. Ramanujan, Stefan Szeider Backdoors to Tractable Valued CSP. Search on Bibsonomy CP The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Ganian Improving Vertex Cover as a Graph Parameter. Search on Bibsonomy Discrete Mathematics & Theoretical Computer Science The full citation details ... 2015 DBLP  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Stefan Szeider Solving Problems on Graphs of High Rank-Width. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Juho Lauri On the Complexity of Rainbow Coloring Problems. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Robert Ganian, M. S. Ramanujan, Stefan Szeider Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Stefan Szeider Meta-Kernelization using Well-Structured Modulators. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Robert Ganian, Petr Hlinený, Daniel Král, Jan Obdrzálek, Jarett Schwartz, Jakub Teska FO Model Checking of Interval Graphs Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa 0001 Parameterized Complexity of Asynchronous Border Minimization. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa 0001 Parameterized Complexity of Asynchronous Border Minimization. Search on Bibsonomy TAMC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Eun Jung Kim 0002, Stefan Szeider Algorithmic Applications of Tree-Cut Width. Search on Bibsonomy MFCS (2) The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Stefan Szeider Community Structure Inspired Algorithms for SAT and #SAT. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Stefan Szeider Solving Problems on Graphs of High Rank-Width. Search on Bibsonomy WADS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Juho Lauri On the Complexity of Rainbow Coloring Problems. Search on Bibsonomy IWOCA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Stefan Szeider Meta-kernelization using Well-structured Modulators. Search on Bibsonomy IPEC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar Lower bounds on the complexity of MSO1 model-checking. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Simone Bova, Robert Ganian, Stefan Szeider Quantified Conjunctive Queries on Partially Ordered Sets. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Simone Bova, Robert Ganian, Stefan Szeider Model Checking Existential Logic on Partially Ordered Sets. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith Digraph width measures in parameterized algorithmics. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Simone Bova, Robert Ganian, Stefan Szeider Model checking existential logic on partially ordered sets. Search on Bibsonomy CSL-LICS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Simone Bova, Robert Ganian, Stefan Szeider Quantified Conjunctive Queries on Partially Ordered Sets. Search on Bibsonomy IPEC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Petr Hlinený, Jan Obdrzálek Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. Search on Bibsonomy Fundam. Inform. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Petr Hlinený, Jan Obdrzálek A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Friedrich Slivovsky, Stefan Szeider Meta-Kernelization with Structural Parameters Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Robert Ganian, Jan Obdrzálek Expanding the expressive power of Monadic Second-Order logic on restricted graph classes. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Robert Ganian, Petr Hlinený, Daniel Král', Jan Obdrzálek, Jarett Schwartz, Jakub Teska FO Model Checking of Interval Graphs. Search on Bibsonomy ICALP (2) The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Friedrich Slivovsky, Stefan Szeider Meta-kernelization with Structural Parameters. Search on Bibsonomy MFCS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Jan Obdrzálek Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes. Search on Bibsonomy IWOCA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Robert Ganian Using Neighborhood Diversity to Solve Hard Problems Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez, Reshma Ramadurai When Trees Grow Low: Shrubs and Fast MSO1. Search on Bibsonomy MFCS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar Lower Bounds on the Complexity of MSO_1 Model-Checking. Search on Bibsonomy STACS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar Lower Bounds on the Complexity of MSO1 Model-Checking Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Robert Ganian, Petr Hlinený, Jan Obdrzálek Clique-width: When Hard Does Not Mean Impossible. Search on Bibsonomy STACS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Robert Ganian New Results on the Complexity of the Max- and Min-Rep Problems. Search on Bibsonomy SOFSEM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Robert Ganian Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics. Search on Bibsonomy IPEC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Petr Hlinený, Jan Obdrzálek Better algorithms for satisfiability problems for formulas of bounded rank-width Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister 0001, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar Are there any good digraph width measures? Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Robert Ganian, Petr Hlinený On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Robert Ganian Thread Graphs, Linear Rank-Width and Their Algorithmic Applications. Search on Bibsonomy IWOCA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Petr Hlinený New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes. Search on Bibsonomy SOFSEM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Petr Hlinený, Jan Obdrzálek Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 105 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license