Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Johan M. M. van Rooij" ( http://dblp.L3S.de/Authors/Johan_M._M._van_Rooij )

  Author page on DBLP  Author page in RDF  Community of Johan M. M. van Rooij in ASPL-2

Publication years (Num. hits)
2008 (3) 2009 (5) 2010 (6) 2011 (6) 2012 (1)
Publication types (Num. hits)
article(7) inproceedings(14)
Venues (Conferences, Journals, ...)
CoRR(3) ESA(2) Theor. Comput. Sci.(2) Algorithmica(1) CIAC(1) Discrete Applied Mathematics(1) FCT(1) FOCS(1) IPEC(1) ISAAC(1) IWPEC(1) MFCS(1) SOFSEM(1) STACS(1) SWAT(1) TAMC(1) More (+10 of total 17)
Authors
Johan M. M. van Rooij(21) Hans L. Bodlaender(8) Bruno Escoffier(4) Daniël Paulusma(4) Jesper Nederlof(4) Nicolas Bourgeois(4) Vangelis Th. Paschos(4) Jakub Onufry Wojtaszczyk(2) Marcin Pilipczuk(2) Marek Cygan(2) Michal Pilipczuk(2) Pim van 't Hof(2) Erik Jan van Leeuwen(1) Marcel E. van Kooten Niekerk(1) Martin Vatshelle(1) Peter Rossmanith(1) More (+10 of total 17)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2 occurrences of 2 keywords
Results
Found 21 publication records. Showing 21 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij Fast Algorithms for max independent set. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Daniël Paulusma, Johan M. M. van Rooij On partitioning a graph into two connected subgraphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk Solving connectivity problems parameterized by treewidth in single exponential time Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Johan M. M. van Rooij, Hans L. Bodlaender Exact algorithms for dominating set. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Johan M. M. van Rooij Exact Algorithms for Intervalizing Colored Graphs. Search on Bibsonomy TAPAS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Johan M. M. van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender Partition into Triangles on Bounded Degree Graphs. Search on Bibsonomy SOFSEM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij Computing role assignments of chordal graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537n){\mathcal O}(1.08537^n). Search on Bibsonomy TAMC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle Faster Algorithms on Branch and Clique Decompositions. Search on Bibsonomy MFCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Jesper Nederlof, Johan M. M. van Rooij Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting. Search on Bibsonomy IPEC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij A Bottom-Up Method and Fast Algorithms for max independent set. Search on Bibsonomy SWAT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Johan M. M. van Rooij Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number. Search on Bibsonomy CIAC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij Fast Algorithms for Max Independent Set in Graphs of Small Average Degree Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Johan M. M. van Rooij, Jesper Nederlof, Thomas C. van Dijk Inclusion/Exclusion Meets Measure and Conquer. Search on Bibsonomy ESA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Johan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. Search on Bibsonomy ESA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij Computing Role Assignments of Chordal Graphs. Search on Bibsonomy FCT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Daniël Paulusma, Johan M. M. van Rooij On Partitioning a Graph into Two Connected Subgraphs. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Johan M. M. van Rooij, Hans L. Bodlaender Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Johan M. M. van Rooij, Hans L. Bodlaender Exact Algorithms for Edge Domination. Search on Bibsonomy IWPEC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF minimum maximal matching, exponential time algorithms, measure and conquer, exact algorithms, edge dominating set
1Johan M. M. van Rooij, Hans L. Bodlaender Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #21 of 21 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.