Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
147 | Derek G. Corneil, Udi Rotics |
On the Relationship between Clique-Width and Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings, pp. 78-90, 2001, Springer, 3-540-42707-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
144 | Sang-il Oum |
Approximating Rank-Width and Clique-Width Quickly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 49-58, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
135 | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
Clique-width minimization is NP-hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 354-362, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
absolute approximation, NP-completeness, clique-width, pathwidth |
133 | Martin Charles Golumbic, Udi Rotics |
On the Clique-Width of Perfect Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings, pp. 135-147, 1999, Springer, 3-540-66731-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
120 | Pinar Heggernes, Daniel Meister 0001, Charis Papadopoulos |
A Complete Characterisation of the Linear Clique-Width of Path Powers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings, pp. 241-250, 2009, Springer, 978-3-642-02016-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
115 | Frank Gurski, Egon Wanke |
The Clique-Width of Tree-Power and Leaf-Power Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, pp. 76-85, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
tree powers, NLC-width, strictly chordal, tree-width, clique-width, leaf powers |
114 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 |
Clique-width: on the price of generality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 825-834, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
105 | Amir H. Farrahi, D. T. Lee, Majid Sarrafzadeh |
Two-Way and Multiway Partitioning of a Set of Intervals for Clique-Width Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 23(3), pp. 187-210, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Partitioning, Interval graphs, Sleep mode, Clique-width |
104 | Omer Giménez, Petr Hlinený, Marc Noy |
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 59-68, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
subexponential algorithm, U polynomial, cographs, clique-width, Tutte polynomial |
101 | Vadim V. Lozin |
From Tree-Width to Clique-Width: Excluding a Unit Interval Graph. ![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. 871-882, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Unit interval graphs, Fixed parameter tractability, Tree-width, Clique-width |
98 | Sang-il Oum |
Approximating rank-width and clique-width quickly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(1), pp. 10:1-10:20, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
rank-width, Approximation algorithms, matroids, clique-width, branch-width |
94 | Bruno Courcelle, Mamadou Moustapha Kanté |
Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, pp. 66-75, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
92 | Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca |
New Graph Classes of Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 38(5), pp. 623-645, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
92 | Alexander Glikson, Johann A. Makowsky |
NCE Graph Grammars and Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers, pp. 237-248, 2003, Springer, 3-540-20452-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
92 | Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca |
New Graph Classes of Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers, pp. 57-67, 2002, Springer, 3-540-00331-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
86 | Frank Gurski, Egon Wanke |
Minimizing NLC-Width is NP-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 69-80, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
85 | Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle |
Boolean-Width of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, pp. 61-74, 2009, Springer, 978-3-642-11268-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
78 | Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin |
Clique-Width for 4-Vertex Forbidden Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 39(4), pp. 561-590, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
78 | Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin |
Clique-Width for Four-Vertex Forbidden Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings, pp. 185-196, 2005, Springer, 3-540-28193-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
78 | Jan Obdrzálek |
Clique-Width and Parity Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, pp. 54-68, 2007, Springer, 978-3-540-74914-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
72 | Feodor F. Dragan, Chenyu Yan |
Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width. ![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. 583-592, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
72 | Frank Gurski, Egon Wanke |
The Tree-Width of Clique-Width Bounded Graphs Without Kn, n. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings, pp. 196-205, 2000, Springer, 3-540-41183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
69 | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
Solving #SAT using vertex covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 44(7-8), pp. 509-523, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
69 | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
Solving #SAT Using Vertex Covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings, pp. 396-409, 2006, Springer, 3-540-37206-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
69 | Georg Gottlob, Reinhard Pichler |
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 708-719, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
66 | Nicholas Korpelainen, Vadim V. Lozin |
Bipartite Graphs of Large Clique-Width. ![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. 385-395, 2009, Springer, 978-3-642-10216-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hereditary class, Tree-width, Clique-width |
66 | Daniel Kobler, Udi Rotics |
Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 468-476, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
coloring, dominating set, polynomial algorithms, edge-coloring, clique-width, edge-dominating set |
64 | Bruno Courcelle, Johann A. Makowsky, Udi Rotics |
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings, pp. 1-16, 1998, Springer, 3-540-65195-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
64 | Pascal Koiran, Klaus Meer |
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers, pp. 252-263, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
61 | Frank Gurski, Egon Wanke |
Vertex Disjoint Paths on Clique-Width Bounded Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings, pp. 119-128, 2004, Springer, 3-540-21258-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
57 | Andreas Brandstädt |
On Robust Algorithms for the Maximum Weight Stable Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings, pp. 445-458, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Maximum Weight Stable Set Problem on graphs, modules and homogeneous sets in graphs, graph structure, clique width, robust algorithms, prime graphs |
52 | Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith |
On Digraph Width Measures in Parameterized Algorithmics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, pp. 185-197, 2009, Springer, 978-3-642-11268-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
52 | Wolfgang Espelage, Frank Gurski, Egon Wanke |
Deciding Clique-Width for Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings, pp. 87-98, 2001, Springer, 3-540-42423-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
50 | Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin |
Computing Graph Polynomials on Graphs of Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers, pp. 191-204, 2006, Springer, 3-540-48381-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
50 | Öjvind Johansson |
NLC2-Decomposition in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings, pp. 110-121, 1999, Springer, 3-540-66731-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
47 | Bruno Courcelle, Andrew Twigg |
Compact Forbidden-Set Routing. ![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. 37-48, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Algorithms, compact routing, labelling schemes |
47 | Öjvind Johansson |
log n-Approximative NLCk-Decomposition in O(n2k+1) Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings, pp. 229-240, 2001, Springer, 3-540-42707-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
44 | Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev |
Between clique-width and linear clique-width of bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 343(8), pp. 111926, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
44 | Daniel Meister 0001, Udi Rotics |
Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1306.2114, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
44 | Pinar Heggernes, Daniel Meister 0001, Udi Rotics |
Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications - 6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011. Proceedings, pp. 233-246, 2011, Springer, 978-3-642-20711-2. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
44 | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
Proving NP-hardness for clique-width II: non-approximability of clique-width ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR05, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
44 | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR05, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
43 | Andreas Brandstädt, Christian Hundt 0001 |
Ptolemaic Graphs and Interval Graphs Are Leaf Powers. ![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. 479-491, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
and Classification Leaf powers, leaf roots, strongly chordal graphs, ptolemaic graphs, graph class inclusions, (unit) interval graphs, clique-width, graph powers |
43 | Frank Gurski, Egon Wanke |
The NLC-width and clique-width for powers of graphs of bounded tree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 157(4), pp. 583-595, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
42 | Wolfgang Espelage, Frank Gurski, Egon Wanke |
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings, pp. 117-128, 2001, Springer, 3-540-42707-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
41 | Vít Jelínek |
The Rank-Width of the Square Grid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers, pp. 230-239, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
rank-width, grid graph |
36 | Pinar Heggernes, Daniel Meister 0001, Charis Papadopoulos |
Graphs of Linear Clique-Width at Most 3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings, pp. 330-341, 2008, Springer, 978-3-540-79227-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Ioan Todinca |
Coloring Powers of Graphs of Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers, pp. 370-382, 2003, Springer, 3-540-20452-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Rodica Boliac, Vadim V. Lozin |
On the Clique-Width of Graphs in Hereditary Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 44-54, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran |
Clique-Width and Directed Width Measures for Answer-Set Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1606.09449, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
33 | Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran |
Clique-Width and Directed Width Measures for Answer-Set Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECAI ![In: ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands - Including Prestigious Applications of Artificial Intelligence (PAIS 2016), pp. 1105-1113, 2016, IOS Press, 978-1-61499-671-2. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
33 | Isolde Adler, Mamadou Moustapha Kanté |
Linear rank-width and linear clique-width of trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 589, pp. 87-98, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
33 | Martin Fürer |
A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1402.1810, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
33 | Martin Fürer |
A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, pp. 72-83, 2014, Springer, 978-3-642-54422-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
33 | Isolde Adler, Mamadou Moustapha Kanté |
Linear Rank-Width and Linear Clique-Width of Trees. ![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. 12-25, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
33 | Hans Adler, Isolde Adler |
A note on clique-width and tree-width for structures ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0806.0103, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
33 | Eldar Fischer, Johann A. Makowsky, Elena V. Ravve |
Counting truth assignments of formulas of bounded tree-width or clique-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 156(4), pp. 511-529, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Karol Suchan, Ioan Todinca |
On powers of graphs of bounded NLC-width (clique-width). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 155(14), pp. 1885-1893, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Frank Gurski |
Characterizations for co-graphs defined by restricted NLC-width or clique-width operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 306(2), pp. 271-277, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Sang-il Oum, Paul D. Seymour |
Approximating clique-width and branch-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 96(4), pp. 514-528, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Georg Gottlob, Reinhard Pichler |
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 33(2), pp. 351-378, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Wolfgang Espelage, Frank Gurski, Egon Wanke |
Deciding Clique-Width for Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 7(2), pp. 141-180, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Robert Ganian, Petr Hlinený |
Better Polynomial Algorithms on Graphs of Bounded Rank-Width. ![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. 266-277, 2009, Springer, 978-3-642-10216-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Rank-width, rank-decomposition, chromatic polynomial, Hamiltonian path, chromatic number |
30 | Petr Hlinený, Sang-il Oum |
Finding Branch-Decompositions and Rank-Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 163-174, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Rank-width, fixed parameter tractable algorithm, graph, matroid, clique-width, branch-width |
28 | Martin Grohe, György Turán |
Learnability and Definability in Trees and Similar Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 37(1), pp. 193-220, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Martin Grohe, György Turán |
Learnability and Definability in Trees and Similar Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings, pp. 645-658, 2002, Springer, 3-540-43283-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Vincent Limouzy, Fabien de Montgolfier, Michaël Rao |
NLC-2 Graph Recognition and Isomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, pp. 86-98, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Stefan Szeider |
On Fixed-Parameter Tractable Parameterizations of SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003 Selected Revised Papers, pp. 188-202, 2003, Springer, 3-540-20851-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Christof Löding |
Ground Tree Rewriting Graphs of Bounded Tree Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings, pp. 559-570, 2002, Springer, 3-540-43283-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
22 | Vasanth Krishna Namasivayam, Animesh Pathak, Viktor K. Prasanna |
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SBAC-PAD ![In: 18th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2006), 17-20 October 2006, Ouro Preto, Minas Gerais, Brazil, pp. 167-176, 2006, IEEE Computer Society, 0-7695-2704-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Narek Bojikian, Stefan Kratsch |
Tight Algorithm for Connected Odd Cycle Transversal Parameterized by Clique-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.08046, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
22 | Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran |
Clique-width of point configurations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 158(Part), pp. 43-73, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Robert Brignall, Daniel Cocks |
A Framework for Minimal Hereditary Classes of Graphs of Unbounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 37(4), pp. 2558-2584, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Vera Chekan, Stefan Kratsch |
Tight Algorithmic Applications of Clique-Width Generalizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.04628, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Narek Bojikian, Stefan Kratsch |
A tight Monte-Carlo algorithm for Steiner Tree parameterized by clique-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.14264, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Falko Hegerfeld, Stefan Kratsch |
Tight algorithms for connectivity problems parameterized by clique-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.03627, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Konrad K. Dabrowski, Tomás Masarík, Jana Novotná 0001, Daniël Paulusma, Pawel Rzazewski |
Clique-width: Harnessing the power of atoms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 104(4), pp. 769-810, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Falko Hegerfeld, Stefan Kratsch |
Tight Algorithms for Connectivity Problems Parameterized by Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands, pp. 59:1-59:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-295-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Vera Chekan, Stefan Kratsch |
Tight Algorithmic Applications of Clique-Width Generalizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France, pp. 35:1-35:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-292-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Robert Brignall, Daniel Cocks |
Uncountably Many Minimal Hereditary Classes of Graphs of Unbounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 29(1), 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Guillaume Ducoffe |
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(11), pp. 3489-3520, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Guillaume Ducoffe |
Optimal Centrality Computations Within Bounded Clique-Width Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(11), pp. 3192-3222, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Marco A. López Medina, J. Leonardo González-Ruiz, José Raymundo Marcial-Romero, José Antonio Hernández Servín |
Computing the Clique-Width on Series-Parallel Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computación y Sistemas ![In: Computación y Sistemas 26(2), 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
22 | Narmina Baghirova, Carolina Lucía Gonzalez, David Schindl |
Locally checkable problems in bounded clique-width graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2203.02992, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov |
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.06845, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Robert Brignall, Daniel Cocks |
A framework for minimal hereditary classes of graphs of unbounded clique-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2203.15446, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Irena Penev |
On the structure and clique-width of ( 4 K 1 , C 4 , C 6 , C 7 ) -free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 99(3), pp. 435-460, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries, David Schindl |
Locally Checkable Problems Parameterized by Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 31:1-31:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov |
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France., pp. 66:1-66:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-235-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Anuj Dawar, Abhisekh Sankaran |
MSO Undecidability for Hereditary Classes of Unbounded Clique Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: 30th EACSL Annual Conference on Computer Science Logic, CSL 2022, February 14-19, 2022, Göttingen, Germany (Virtual Conference)., pp. 17:1-17:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-218-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy |
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.08693, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
22 | Chris Aronis |
The Algorithmic Complexity of Tree-Clique Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.02200, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
22 | Aistis Atminas, Robert Brignall, Vadim V. Lozin, Juraj Stacho |
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 295, pp. 57-69, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Frank Gurski, Dominique Komander, Carolin Rehs |
Acyclic Coloring Parameterized by Directed Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CALDAM ![In: Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Rupnagar, India, February 11-13, 2021, Proceedings, pp. 95-108, 2021, Springer, 978-3-030-67898-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | J. Leonardo González-Ruiz, José Raymundo Marcial-Romero, José Antonio Hernández Servín, Guillermo De Ita |
Approximate the Clique-Width of a Graph Using Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICAI (2) ![In: Advances in Soft Computing - 20th Mexican International Conference on Artificial Intelligence, MICAI 2021, Mexico City, Mexico, October 25-30, 2021, Proceedings, Part II, pp. 337-347, 2021, Springer, 978-3-030-89819-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti |
Succinct Data Structures for Small Clique-Width Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCC ![In: 31st Data Compression Conference, DCC 2021, Snowbird, UT, USA, March 23-26, 2021, pp. 133-142, 2021, IEEE, 978-1-6654-0333-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov |
b-Coloring Parameterized by Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 43:1-43:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy |
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings, pp. 92-106, 2021, Springer, 978-3-030-79986-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Guillaume Ducoffe |
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, September 8-10, 2021, Lisbon, Portugal., pp. 15:1-15:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-216-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Guillaume Ducoffe |
Optimal Centrality Computations Within Bounded Clique-Width Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, September 8-10, 2021, Lisbon, Portugal., pp. 16:1-16:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-216-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|