Finding H-partitions efficiently
RAIRO-Theor. Inf. Appl., 39 1 (2005) 133-144
Published online: 2005-03-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
1 (2021)
https://doi.org/10.1109/LICS52264.2021.9470632
Disconnected cuts in claw-free graphs
Barnaby Martin, Daniël Paulusma and Erik Jan van LeeuwenJournal of Computer and System Sciences 113 60 (2020)
https://doi.org/10.1016/j.jcss.2020.04.005
The computational complexity of disconnected cut and 2K2-partition
Barnaby Martin and Daniël PaulusmaJournal of Combinatorial Theory, Series B 111 17 (2015)
https://doi.org/10.1016/j.jctb.2014.09.002
Graph partitions with prescribed patterns
Pavol HellEuropean Journal of Combinatorics 35 335 (2014)
https://doi.org/10.1016/j.ejc.2013.06.043
Obstructions to partitions of chordal graphs
Tomás Feder, Pavol Hell and Shekoofeh Nekooei RiziDiscrete Mathematics 313 (19) 1861 (2013)
https://doi.org/10.1016/j.disc.2012.05.023
2K2-partition of some classes of graphs
Simone Dantas, Frédéric Maffray and Ana SilvaDiscrete Applied Mathematics 160 (18) 2662 (2012)
https://doi.org/10.1016/j.dam.2010.09.009
The P versus NP–complete dichotomy of some challenging problems in graph theory
Celina M.H. de FigueiredoDiscrete Applied Mathematics 160 (18) 2681 (2012)
https://doi.org/10.1016/j.dam.2010.12.014
Computing vertex-surjective homomorphisms to partially reflexive trees
Petr A. Golovach, Daniël Paulusma and Jian SongTheoretical Computer Science 457 86 (2012)
https://doi.org/10.1016/j.tcs.2012.06.039
The complexity of surjective homomorphism problems—a survey
Manuel Bodirsky, Jan Kára and Barnaby MartinDiscrete Applied Mathematics 160 (12) 1680 (2012)
https://doi.org/10.1016/j.dam.2012.03.029
A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More)
Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry WojtaszczykSIAM Journal on Computing 41 (4) 815 (2012)
https://doi.org/10.1137/110826813
Computer Science – Theory and Applications
Petr A. Golovach, Daniël Paulusma and Jian SongLecture Notes in Computer Science, Computer Science – Theory and Applications 6651 261 (2011)
https://doi.org/10.1007/978-3-642-20712-9_20
The external constraint 4 nonempty part sandwich problem
Rafael B. Teixeira, Simone Dantas and Celina M.H. de FigueiredoDiscrete Applied Mathematics 159 (7) 661 (2011)
https://doi.org/10.1016/j.dam.2010.03.015
Partitioning Chordal Graphs
Tomás Feder, Pavol Hell and Shekoofeh Nekooei RiziElectronic Notes in Discrete Mathematics 38 325 (2011)
https://doi.org/10.1016/j.endm.2011.09.053
Parameterizing cut sets in a graph by the number of their components
Takehiro Ito, Marcin Kamiński, Daniël Paulusma and Dimitrios M. ThilikosTheoretical Computer Science 412 (45) 6340 (2011)
https://doi.org/10.1016/j.tcs.2011.07.005
Principles and Practice of Constraint Programming – CP 2011
Barnaby Martin and Daniël PaulusmaLecture Notes in Computer Science, Principles and Practice of Constraint Programming – CP 2011 6876 561 (2011)
https://doi.org/10.1007/978-3-642-23786-7_43
On disconnected cuts and separators
Takehiro Ito, Marcin Kamiński, Daniël Paulusma and Dimitrios M. ThilikosDiscrete Applied Mathematics 159 (13) 1345 (2011)
https://doi.org/10.1016/j.dam.2011.04.027
2K2 vertex-set partition into nonempty parts
Kathryn Cook, Simone Dantas, Elaine M. Eschen, et al.Discrete Mathematics 310 (6-7) 1259 (2010)
https://doi.org/10.1016/j.disc.2009.11.030
The polynomial dichotomy for three nonempty part sandwich problems
Rafael B. Teixeira, Simone Dantas and Celina M.H. de FigueiredoDiscrete Applied Mathematics 158 (12) 1286 (2010)
https://doi.org/10.1016/j.dam.2009.12.002
Covering graphs with few complete bipartite subgraphs
Herbert Fleischner, Egbert Mujuni, Daniël Paulusma and Stefan SzeiderTheoretical Computer Science 410 (21-23) 2045 (2009)
https://doi.org/10.1016/j.tcs.2008.12.059
Algorithms and Computation
Takehiro Ito, Marcin Kamiński, Daniël Paulusma and Dimitrios M. ThilikosLecture Notes in Computer Science, Algorithms and Computation 5878 605 (2009)
https://doi.org/10.1007/978-3-642-10631-6_62
The Complexity of the List Partition Problem for Graphs
Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng and R. SritharanSIAM Journal on Discrete Mathematics 21 (4) 900 (2008)
https://doi.org/10.1137/060666238
The polynomial dichotomy for three nonempty part sandwich problems
Rafael B. Teixeira, Simone Dantas and Celina M.H. de FigueiredoElectronic Notes in Discrete Mathematics 30 81 (2008)
https://doi.org/10.1016/j.endm.2008.01.015
2K2 vertex-set partition into nonempty parts
Simone Dantas, Elaine M. Eschen, Luerbio Faria, Celina M.H. de Figueiredo and Sulamita KleinElectronic Notes in Discrete Mathematics 30 291 (2008)
https://doi.org/10.1016/j.endm.2008.01.050
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science
Herbert Fleischner, Egbert Mujuni, Daniel Paulusma and Stefan SzeiderLecture Notes in Computer Science, FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science 4855 340 (2007)
https://doi.org/10.1007/978-3-540-77050-3_28
Matrix Partitions with Finitely Many Obstructions
Tomás Feder, Pavol Hell and Wing XieElectronic Notes in Discrete Mathematics 28 371 (2007)
https://doi.org/10.1016/j.endm.2007.01.057
On the structure of self-complementary graphs
Nicolas TrotignonElectronic Notes in Discrete Mathematics 22 79 (2005)
https://doi.org/10.1016/j.endm.2005.06.014