Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
21 | Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon |
b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 73(2), pp. 289-305, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
21 | Christopher Purcell, M. Puck Rombach |
On the complexity of role colouring planar graphs, trees and cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Discrete Algorithms ![In: J. Discrete Algorithms 35, pp. 1-8, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
21 | Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung, Yue-Li Wang |
On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Discrete Algorithms ![In: J. Discrete Algorithms 30, pp. 21-28, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
21 | Christophe Crespelle, Philippe Gambette |
(Nearly-)tight bounds on the contiguity and linearity of cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 522, pp. 1-12, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Paul S. Bonsma |
Independent Set Reconfiguration in Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1402.1587, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
21 | Carl Feghali, Faisal N. Abu-Khzam, Haiko Müller |
Forbidden subgraph characterization of (P3-free, K3-free)-colourable cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1403.5961, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
21 | Marthe Bonamy, Nicolas Bousquet |
Reconfiguring Independent Sets in Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1406.1433, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
21 | Christopher Purcell, M. Puck Rombach |
On the Complexity of Role Colouring Planar Graphs, Trees and Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1408.5412, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
21 | Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra |
Corrigendum to "Polar cographs" [Discrete Appl. Math. 156(2008) 1652-1660]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 171, pp. 158, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Elad Cohen, Martin Charles Golumbic, Bernard Ries |
Characterizations of cographs as intersection graphs of paths on a grid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 178, pp. 46-57, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Paul Dorbec, Mickaël Montassier, Pascal Ochem |
Vertex Partitions of Graphs into Cographs and Stars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 75(1), pp. 75-90, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Paul S. Bonsma |
Independent Set Reconfiguration in Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 105-116, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon |
b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCO ![In: Combinatorial Optimization - Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers, pp. 100-111, 2014, Springer, 978-3-319-09173-0. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Flavia Bonomo, Guillermo Durán, Luciano N. Grippo, Martín Darío Safe |
Probe interval graphs and probe unit interval graphs on superclasses of cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 15(2), pp. 177-194, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti |
Cycle transversals in perfect graphs and cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 469, pp. 15-23, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti |
Corrigendum to "Cycle transversals in perfect graphs and cographs" [Theoret. Comput. Sci. 469(2013) 15-23]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 487, pp. 103-105, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Ton Kloks, Yue-Li Wang |
On retracts and folds in cographs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1301.3979, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
21 | Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Sheung-Hung Poon, Yue-Li Wang |
Independent set in categorical products of cographs and splitgraphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1305.4237, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
21 | Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon |
b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1310.8313, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
21 | Vincent Cohen-Addad, Michel Habib, Fabien de Montgolfier |
Algorithmic Aspects of Switch Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1310.1012, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
21 | Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano |
Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Algorithms Appl. ![In: Discret. Math. Algorithms Appl. 5(2), 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Yong Gao 0001, Donovan R. Hare, James Nastos |
The cluster deletion problem for cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 313(23), pp. 2763-2771, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Christophe Crespelle, Philippe Gambette |
Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013. Proceedings, pp. 126-136, 2013, Springer, 978-3-642-36064-0. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Ton Kloks, Yue-Li Wang |
On Retracts, Absolute Retracts, and Folds in Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 321-332, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Ji Li |
Combinatorial Logarithm and Point-Determining Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 19(3), pp. 8, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
21 | Katarzyna Jesse-Józefczyk |
The possible cardinalities of global secure sets in cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 414(1), pp. 38-46, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
21 | Ton Kloks |
A note on probe cographs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1202.0364, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
21 | Petr A. Golovach, Pinar Heggernes, Rodica Mihai |
Edge search number of cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 160(6), pp. 734-743, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
21 | Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano |
Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation - 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012. Proceedings, pp. 5-16, 2012, Springer, 978-3-642-28075-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
21 | Jean-François Couturier 0001, Pinar Heggernes, Pim van 't Hof, Yngve Villanger |
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings, pp. 133-144, 2012, Springer, 978-3-642-32240-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
21 | Guillermo Durán, Luciano N. Grippo, Martín Darío Safe |
Probe interval and probe unit interval graphs on superclasses of cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 37, pp. 339-344, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Ling-Ju Hung, Ton Kloks |
k-Cographs are Kruskalian. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Chic. J. Theor. Comput. Sci. ![In: Chic. J. Theor. Comput. Sci. 2011, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
21 | Ruo-Wei Hung, Chih-Chia Yao |
Linear-time algorithm for the matched-domination problem in cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Math. ![In: Int. J. Comput. Math. 88(10), pp. 2042-2056, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Sun-Yuan Hsieh |
On parallel recognition of cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 412(8-10), pp. 686-694, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Andrew Lyons |
Acyclic and Star Colorings of Cographs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1103.5531, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
21 | Ton Kloks, Chin-Ting Ung, Yue-Li Wang |
On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1110.1693, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
21 | Türker Bíyíkoglu, Slobodan K. Simic, Zoran Stanic |
Some Notes On Spectra Of Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 100, pp. 421-434, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
21 | Andrew Lyons |
Acyclic and star colorings of cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 159(16), pp. 1842-1850, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Maria Chroni, Stavros D. Nikolopoulos |
Encoding watermark numbers as cographs using self-inverting permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CompSysTech ![In: Proceedings of the 12th International Conference on Computer Systems and Technologies, CompSysTech 2011, Vienna, Austria, June 16-17, 2011, pp. 142-148, 2011, ACM, 978-1-4503-0917-2. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Oleg V. Zubkov, Dmitry V. Chistikov, Andrey A. Voronenko |
An Upper Bound on Checking Test Complexity for Almost All Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SYNASC ![In: 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2011, Timisoara, Romania, September 26-29, 2011, pp. 323-330, 2011, IEEE Computer Society, 978-1-4673-0207-4. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
21 | B. S. Panda 0001, Dinabandhu Pradhan |
Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 110(23), pp. 1067-1073, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
21 | John Gimbel, Jaroslav Nesetril |
Partitions of graphs into cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 310(24), pp. 3437-3445, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
21 | Flavia Bonomo, Guillermo Durán, Frédéric Maffray, Javier Marenco, Mario Valencia-Pabon |
On the b-Coloring of Cographs and P4-Sparse Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 25(2), pp. 153-167, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Stavros D. Nikolopoulos, Charis Papadopoulos |
Counting Spanning Trees in Cographs: An Algorithmic Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 90, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
21 | Andrew Lyons |
Acyclic and Star Colorings of Joins of Graphs and an Algorithm for Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CTW ![In: Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009, pp. 199-202, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
21 | Torsten Sander |
On Certain Eigenspaces of Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 15(1), 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
21 | Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra |
Polar cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 156(10), pp. 1652-1660, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra |
Polar cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 28, pp. 317-323, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Sun-Yuan Hsieh |
A faster parallel connectivity algorithm on cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Lett. ![In: Appl. Math. Lett. 20(3), pp. 341-344, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Katerina Asdre, Stavros D. Nikolopoulos |
A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 50(4), pp. 231-240, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Van Bang Le, H. N. de Ridder |
Linear-time certifying recognition for partitioned probe cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes ![In: Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007, 2007, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
21 | Martin Charles Golumbic, Aviad Mintz, Udi Rotics |
Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 154(10), pp. 1465-1477, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Christophe Crespelle, Christophe Paul |
Fully dynamic recognition algorithm and certificate for directed cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 154(12), pp. 1722-1741, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Raquel de Souza Francisco, Sulamita Klein, Loana Tito Nogueira |
Characterizing (k, l)-partitionable Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 22, pp. 277-280, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Veeraraghavan Prakash |
An efficient g-centroid location algorithm for cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Math. Math. Sci. ![In: Int. J. Math. Math. Sci. 2005(9), pp. 1405-1413, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Stavros D. Nikolopoulos, Leonidas Palios |
Efficient parallel recognition of cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 150(1-3), pp. 182-215, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Marc Demange, Tínaz Ekim, Dominique de Werra |
Partitioning cographs into cliques and stable sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 2(2), pp. 145-153, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Anna Bretscher |
LexBFS based recognition algorithms for cographs and related families. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2005 |
RDF |
|
21 | Ron Shamir, Roded Sharan |
A fully dynamic algorithm for modular decomposition and recognition of cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 136(2-3), pp. 329-340, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Francisco Larrión, Célia Picinin de Mello, Aurora Morgana, Victor Neumann-Lara, Miguel A. Pizaña |
The clique operator on cographs and serial graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 282(1-3), pp. 183-191, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Stavros D. Nikolopoulos, Charis Papadopoulos |
Counting Spanning Trees in Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 13, pp. 84-92, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Koji Nakano, Stephan Olariu, Albert Y. Zomaya |
A time-optimal solution for the path cover problem on cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 290(3), pp. 1541-1556, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Christian Retoré |
Handsome proof-nets: perfect matchings and cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 294(3), pp. 473-488, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Vassilis Giakoumakis, Jean-Marie Vanherpe |
Linear Time Recognition and Optimizations for Weak-Bisplit Graphs, Bi-Cographs and Bipartite P6-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 14(1), pp. 107-136, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | John Gimbel, Jaroslav Nesetril |
Partitions of Graphs into Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 11, pp. 705-721, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Vlady Ravelomanana, Loÿs Thimonier |
Asymptotic enumeration of cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 7, pp. 58-61, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Guillaume Damiand, Michel Habib, Christophe Paul |
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 263(1-2), pp. 99-111, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Martin Charles Golumbic, Aviad Mintz, Udi Rotics |
Factoring and Recognition of Read-Once Functions using Cographs and Normality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 38th Design Automation Conference, DAC 2001, Las Vegas, NV, USA, June 18-22, 2001, pp. 109-114, 2001, ACM, 1-58113-297-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Stavros D. Nikolopoulos |
Recognizing cographs and threshold graphs through a classification of their edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 74(3-4), pp. 129-139, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Terry A. McKee |
Dimensions for Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 56, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
21 | William C. K. Yen, C. Y. Tang |
The searchlight guarding problem on weighted split graphs and weighted cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 35(3), pp. 195-206, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Chuan-Ming Liu, Ming-Shing Yu |
An Optimal Parallel Algorithm for Node Ranking of Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 87(1-3), pp. 187-201, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
21 | David G. Kirkpatrick, Madhukar K. Reddy, C. Pandu Rangan, Anand Srinivasan |
Partial and Perfect Path Covers of Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 89(1-3), pp. 143-153, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
21 | Elias Dahlhaus |
Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 57(1), pp. 29-44, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
21 | Rong Lin, Stephan Olariu |
An Optimal Parallel Matching Algorithm for Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Parallel Distributed Comput. ![In: J. Parallel Distributed Comput. 22(1), pp. 26-36, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
21 | Rong Lin, Stephan Olariu, James L. Schwing, Jingyuan Zhang |
An Efficient Erew Algorithm for Minimum Path Cover and Hamiltonicity on Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parallel Algorithms Appl. ![In: Parallel Algorithms Appl. 2(1-2), pp. 99-113, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
21 | Ming-Shing Yu, Cheng-Hsing Yang |
An O(n) Time Algorithm for Maximum Matching on Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 47(2), pp. 89-93, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
21 | Ming-Shing Yu, Cheng-Hsing Yang |
A Linear Time Algorithm for the Maximum Matching Problem on Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 33(3), pp. 420-432, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
21 | Hans L. Bodlaender, Rolf H. Möhring |
The Pathwidth and Treewidth of Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 6(2), pp. 181-188, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
21 | Rong Lin, Stephan Olariu |
An NC Recognition Algorithm for Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Parallel Distributed Comput. ![In: J. Parallel Distributed Comput. 13(1), pp. 76-90, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
21 | Rong Lin, Stephan Olariu |
A Fast Parallel Algorithm to Compute Path Functions for Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP (3) ![In: Proceedings of the International Conference on Parallel Processing, ICPP '91, Austin, Texas, USA, August 1991. Volume III: Algorithms and Applications., pp. 263-266, 1991, CRC Press. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP BibTeX RDF |
|
21 | Gur Saran Adhar, Shietung Peng |
Parallel Algorithms for Cographs and Parity Graphs with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 11(2), pp. 252-284, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
21 | Hans L. Bodlaender, Rolf H. Möhring |
The Pathwidth and Treewidth of Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: SWAT 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 11-14, 1990, Proceedings, pp. 301-309, 1990, Springer, 3-540-52846-6. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
21 | Gur Saran Adhar, Shietung Peng |
Parallel Algorithms for Path Covering, Hamiltonian Path and Hamiltonian Cycle in Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP (3) ![In: Proceedings of the 1990 International Conference on Parallel Processing, Urbana-Champaign, IL, USA, August 1990. Volume 3: Algorithms and Applications., pp. 364-365, 1990, Pennsylvania State University Press. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP BibTeX RDF |
|
21 | Hans L. Bodlaender |
Achromatic Number is NP-Complete for Cographs and Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 31(3), pp. 135-138, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
21 | Gottfried Tinhofer |
Strong tree-cographs are birkhoff graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 22(3), pp. 275-288, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
21 | Gur Saran Adhar, Shietung Peng |
Parallel Algorithms for Cographs Recognition and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, Workshop WADS '89, Ottawa, Canada, August 17-19, 1989, Proceedings, pp. 335-351, 1989, Springer, 3-540-51542-9. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
21 | Derek G. Corneil, Yehoshua Perl, Lorna K. Stewart |
A Linear Recognition Algorithm for Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 14(4), pp. 926-934, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
17 | Petr A. Golovach, Pinar Heggernes |
Choosability of P5-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings, pp. 382-391, 2009, Springer, 978-3-642-03815-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Tínaz Ekim, Pinar Heggernes, Daniel Meister 0001 |
Polar Permutation Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pp. 218-229, 2009, Springer, 978-3-642-10216-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Richard B. Borie, R. Gary Parker, Craig A. Tovey |
Solving problems on recursively constructed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Comput. Surv. ![In: ACM Comput. Surv. 41(1), pp. 4:1-4:51, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Halin graph, branchwidth, cliquewidth, cutwidth, rankwidth, series parallel, dynamic programming, tree, Bandwidth, treewidth, cograph, pathwidth |
17 | Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca |
Independent Sets of Maximum Weight in Apple-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 848-858, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
clique separators, apple-free graphs, polynomial-time algorithm, Maximum independent set, modular decomposition, claw-free graphs |
17 | Ruei-Yuan Chang, Guanling Lee, Sheng-Lung Peng |
Minimum Vertex Ranking Spanning Tree Problem on Some Classes of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (2) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 4th International Conference on Intelligent Computing, ICIC 2008, Shanghai, China, September 15-18, 2008, Proceedings, pp. 758-765, 2008, Springer, 978-3-540-85983-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
17 | Pinar Heggernes, Dieter Kratsch, Daniel Meister 0001 |
Bandwidth of Bipartite Permutation Graphs in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 216-227, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
17 | Sun-Yuan Hsieh |
An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 39(1), pp. 39-57, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
The perfect domination problem, Parallel algorithms, Parallel random access machine (PRAM), Distance-hereditary graphs |
17 | Marc Tedder, Derek G. Corneil |
An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 344-355, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
graph recognition, distance-hereditary, dynamic algorithm, cograph |
17 | Robin Nunkesser, Philipp Woelfel |
Representation of Graphs by OBDDs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 1132-1142, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
17 | Maw-Shang Chang, Ton Kloks, Dieter Kratsch, Jiping Liu, Sheng-Lung Peng |
On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, pp. 808-817, 2005, Springer, 3-540-28061-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
17 | Gerard J. Chang, Chiuyuan Chen, Yaping Chen |
Vertex and Tree Arboricities of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 8(3), pp. 295-306, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
arboricity, block-cactus graph, tree, planar graph, hamiltonian cycle, cograph, acyclic, series-parallel graph, girth |
17 | Michael U. Gerber, Vadim V. Lozin |
Robust Algorithms for the Stable Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 19(3), pp. 347-356, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Stable set, Stability number, Polynomial algorithm |