The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Daniël Paulusma" ( http://dblp.L3S.de/Authors/Daniël_Paulusma )

URL (Homepage):  https://community.dur.ac.uk/daniel.paulusma/  Author page on DBLP  Author page in RDF  Community of Daniël Paulusma in ASPL-2

Publication years (Num. hits)
2000-2006 (15) 2007-2008 (16) 2009 (16) 2010 (17) 2011 (17) 2012 (29) 2013 (21) 2014 (28) 2015 (34) 2016 (23) 2017 (33) 2018 (25) 2019 (21)
Publication types (Num. hits)
article(186) inproceedings(107) proceedings(2)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 9 occurrences of 6 keywords

Results
Found 296 publication records. Showing 295 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries Classifying k-edge colouring for H-free graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Daniël Paulusma, Stefan Szeider On the parameterized complexity of (k, s)-SAT. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Paul S. Bonsma, Daniël Paulusma Using contracted solution graphs for solving reconfiguration problems. Search on Bibsonomy Acta Inf. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Daniël Paulusma Independent Feedback Vertex Set for P5-Free Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma Bounding clique-width via perfect graphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Shenwei Huang, Daniël Paulusma Colouring square-free graphs without long induced paths. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Konrad K. Dabrowski, Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries On the Parameterized Complexity of k-Edge Colouring. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Konrad K. Dabrowski, Matthew Johnson 0002, Daniël Paulusma Clique-Width for Hereditary Graph Classes. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Matthew Johnson 0002, Barnaby Martin, George B. Mertzios, Daniël Paulusma Report on BCTCS & AlgoUK 2019. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2019 DBLP  BibTeX  RDF
1Daniël Paulusma, Christophe Picouleau, Bernard Ries Critical vertices and edges in H-free graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Benoît Larose, Barnaby Martin, Daniël Paulusma Surjective H-Colouring over Reflexive Digraphs. Search on Bibsonomy TOCT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Matthew Johnson 0002, Barnaby Martin, Daniël Paulusma, Anthony Stewart Surjective H-colouring: New hardness results. Search on Bibsonomy Computability The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson 0002, Daniël Paulusma, Stéphane Vialette Finding a Small Number of Colourful Components. Search on Bibsonomy CPM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Barnaby Martin, Daniël Paulusma, Siani Smith Colouring H-Free Graphs of Bounded Diameter. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Carl Feghali, Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. Search on Bibsonomy FCT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson 0002, Daniël Paulusma Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. Search on Bibsonomy WADS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Florin Manea, Barnaby Martin, Daniël Paulusma, Giuseppe Primiero (eds.) Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15-19, 2019, Proceedings Search on Bibsonomy CiE The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma Generalized Matching Games for International Kidney Exchange. Search on Bibsonomy AAMAS The full citation details ... 2019 DBLP  BibTeX  RDF
1Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. Search on Bibsonomy Order The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Konrad K. Dabrowski, Daniël Paulusma On colouring (2P2, H)-free and (P5, H)-free graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Daniël Paulusma Independent feedback vertex sets for graphs of bounded diameter. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson 0002, Martin Milanic, Daniël Paulusma Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries Contraction and deletion blockers for perfect graphs and H-free graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart Finding Cactus Roots in Polynomial Time. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Walter Kern, Daniël Paulusma Contracting to a Longest Path in H-Free Graphs. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Serge Gaspers, Shenwei Huang, Daniël Paulusma Colouring Square-Free Graphs without Long Induced Paths. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Tereza Klimosova, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová Colouring (P_r+P_s)-Free Graphs. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries Classifying k-Edge Colouring for H-free Graphs. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma Simple Games versus Weighted Voting Games: Bounding the Critical Threshold Value. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma Simple Games versus Weighted Voting Games. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson 0002, Daniël Paulusma Graph Isomorphism for (H1, H2)-free Graphs: An Almost Complete Dichotomy. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson 0002, Daniël Paulusma, Stéphane Vialette Finding a Small Number of Colourful Components. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen Disconnected Cuts in Claw-free Graphs. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Manfred Cochefert, Jean-François Couturier 0001, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart Computing square roots of graphs with low maximum degree. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky The stable fixtures problem with payments. Search on Bibsonomy Games and Economic Behavior The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tereza Klimosova, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová Colouring (P_r+P_s)-Free Graphs. Search on Bibsonomy ISAAC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma Simple Games Versus Weighted Voting Games. Search on Bibsonomy SAGT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen Disconnected Cuts in Claw-free Graphs. Search on Bibsonomy ESA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Konrad K. Dabrowski, Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma Computing Small Pivot-Minors. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Shenwei Huang, Daniël Paulusma Colouring Square-Free Graphs without Long Induced Paths. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Benoît Larose, Barnaby Martin, Daniël Paulusma Surjective H-Colouring over Reflexive Digraphs. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Konrad K. Dabrowski, Daniël Paulusma Contracting Bipartite Graphs to Paths and Cycles. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Christophe Picouleau, Daniël Paulusma, Bernard Ries Reducing the Chromatic Number by Vertex or Edge Deletions. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Konrad K. Dabrowski, Daniël Paulusma Contracting bipartite graphs to paths and cycles. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Carl Feghali, Matthew Johnson 0002, Daniël Paulusma Kempe equivalence of colourings of cubic graphs. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart A linear kernel for finding square roots of almost planar graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Konrad K. Dabrowski, François Dross, Daniël Paulusma Colouring diamond-free graphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos Editing to a planar graph of given degrees. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Konrad Dabrowski, Daniël Paulusma On Colouring (2P2, H)-Free and (P5, H)-Free Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Benoît Larose, Barnaby Martin, Daniël Paulusma Surjective H-Colouring over Reflexive Digraphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma Connected Vertex Cover for (sP1+P5)-Free Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Petr A. Golovach, Matthew Johnson 0002, Barnaby Martin, Daniël Paulusma, Anthony Stewart Surjective H-Colouring: New Hardness Results. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson 0002, Martin Milanic, Daniël Paulusma Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Daniël Paulusma Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Konrad Kazimierz Dabrowski, Daniël Paulusma Contracting Bipartite Graphs to Paths and Cycles. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Daniël Paulusma Independent Feedback Vertex Set for $P_5$-free Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Alexandre Blanché, Konrad Dabrowski, Matthew Johnson 0002, Vadim V. Lozin, Daniël Paulusma, Victor Zamaraev Clique-Width for Graph Classes Closed under Complementation. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Daniël Paulusma Independent Feedback Vertex Sets for Graphs of Bounded Diameter. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Daniël Paulusma, Christophe Picouleau, Bernard Ries Critical Vertices and Edges in $H$-free Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Petr A. Golovach, Daniël Paulusma, Iain A. Stewart Graph editing to a fixed target. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Rémy Belmonte, Pim van 't Hof, Marcin Kaminski 0001, Daniël Paulusma The price of connectivity for feedback vertex set. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Bostjan Bresar, Pinar Heggernes, Marcin Jakub Kaminski, Martin Milanic, Daniël Paulusma, Primoz Potocnik, Nicolas Trotignon Preface: Algorithmic Graph Theory on the Adriatic Coast. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma Bounding the Clique-Width of H-Free Chordal Graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Matthew Johnson 0002, Daniël Paulusma, Jian Song A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Daniël Paulusma Independent Feedback Vertex Set for P_5-free Graphs. Search on Bibsonomy ISAAC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Daniël Paulusma, Christophe Picouleau, Bernard Ries Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions. Search on Bibsonomy TAMC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson 0002, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev Clique-Width for Graph Classes Closed under Complementation. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Daniël Paulusma Recognizing Graphs Close to Bipartite Graphs. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Matthew Johnson 0002, Barnaby Martin, Daniël Paulusma, Anthony Stewart Surjective H-Colouring: New Hardness Results. Search on Bibsonomy CiE The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart Squares of Low Clique Number. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Manfred Cochefert, Jean-François Couturier 0001, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma Parameterized Algorithms for Finding Square Roots. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Matthew Johnson 0002, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma Finding Shortest Paths Between Graph Colourings. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider Model Counting for CNF Formulas of Bounded Modular Treewidth. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tatiana Romina Hartinger, Matthew Johnson 0002, Martin Milanic, Daniël Paulusma The price of connectivity for cycle transversals. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen Induced disjoint paths in circular-arc graphs in linear time. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma Editing to Eulerian graphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart A Linear Kernel for Finding Square Roots of Almost Planar Graphs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Manfred Cochefert, Jean-François Couturier 0001, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart Squares of Low Maximum Degree. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Konrad Kazimierz Dabrowski, Vadim V. Lozin, Daniël Paulusma Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Alexandre Blanché, Konrad Kazimierz Dabrowski, Matthew Johnson 0002, Daniël Paulusma Colouring on Hereditary Graph Classes Closed under Complementation. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1David Allison, Daniël Paulusma New Bounds for the Snake-in-the-Box Problem. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Andreas Brandstädt, Konrad Dabrowski, Shenwei Huang, Daniël Paulusma Bounding the clique-width of H-free split graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Konrad Kazimierz Dabrowski, Daniël Paulusma Classifying the clique-width of H-free bipartite graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Marcin Kaminski 0001, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos Minimal disconnected cuts in planar graphs. Search on Bibsonomy Networks The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Konrad Dabrowski, Daniël Paulusma Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs. Search on Bibsonomy Comput. J. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Carl Feghali, Matthew Johnson 0002, Daniël Paulusma A Reconfigurations Analogue of Brooks' Theorem and Its Consequences. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Paul S. Bonsma, Daniël Paulusma Using Contracted Solution Graphs for Solving Reconfiguration Problems. Search on Bibsonomy MFCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Daniël Paulusma, Christophe Picouleau, Bernard Ries Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions. Search on Bibsonomy ISCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart Finding Cactus Roots in Polynomial Time. Search on Bibsonomy IWOCA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Konrad Dabrowski, Vadim V. Lozin, Daniël Paulusma Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. Search on Bibsonomy IWOCA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 295 (100 per page; Change: )
Pages: [1][2][3][>>]
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