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:

Algorithms and Discrete Applied Mathematics

Sriram Bhyravarapu and I. Vinod Reddy
Lecture Notes in Computer Science, Algorithms and Discrete Applied Mathematics 13947 159 (2023)
https://doi.org/10.1007/978-3-031-25211-2_12

A polynomial time algorithm to compute the connected treewidth of a series–parallel graph

Guillaume Mescoff, Christophe Paul and Dimitrios M. Thilikos
Discrete Applied Mathematics 312 72 (2022)
https://doi.org/10.1016/j.dam.2021.02.039

Exploring the gap between treedepth and vertex cover through vertex integrity

Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi and Yota Otachi
Theoretical Computer Science 918 60 (2022)
https://doi.org/10.1016/j.tcs.2022.03.021

A general framework for path convexities

João Vinicius C. Thompson, Loana T. Nogueira, Fábio Protti, et al.
Journal of Combinatorial Optimization 43 (5) 994 (2022)
https://doi.org/10.1007/s10878-020-00618-9

An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL

Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis and Dimitrios M. Thilikos
ACM Transactions on Computation Theory 14 (3-4) 1 (2022)
https://doi.org/10.1145/3571278

Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics

Bertrand Marchand, Yann Ponty and Laurent Bulteau
Algorithms for Molecular Biology 17 (1) (2022)
https://doi.org/10.1186/s13015-022-00213-z

Vertex partitioning problems on graphs with bounded tree width

N.R. Aravind, Subrahmanyam Kalyanasundaram and Anjeneya Swami Kare
Discrete Applied Mathematics 319 254 (2022)
https://doi.org/10.1016/j.dam.2021.05.016

Algorithms and Complexity

Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi and Yota Otachi
Lecture Notes in Computer Science, Algorithms and Complexity 12701 271 (2021)
https://doi.org/10.1007/978-3-030-75242-2_19

Clique-width III

Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh and Meirav Zehavi
ACM Transactions on Algorithms 15 (1) 1 (2019)
https://doi.org/10.1145/3280824

Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima and Daniël Paulusma
Algorithmica 81 (7) 2795 (2019)
https://doi.org/10.1007/s00453-019-00555-y

Safe sets in graphs: Graph classes and structural parameters

Raquel Águeda, Nathann Cohen, Shinya Fujita, et al.
Journal of Combinatorial Optimization 36 (4) 1221 (2018)
https://doi.org/10.1007/s10878-017-0205-2

Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity

Hans L. Bodlaender, Hirotaka Ono and Yota Otachi
Algorithmica 80 (7) 2160 (2018)
https://doi.org/10.1007/s00453-017-0399-9

Computing square roots of graphs with low maximum degree

Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma and Anthony Stewart
Discrete Applied Mathematics 248 93 (2018)
https://doi.org/10.1016/j.dam.2017.04.041

A linear kernel for finding square roots of almost planar graphs

Petr A. Golovach, Dieter Kratsch, Daniël Paulusma and Anthony Stewart
Theoretical Computer Science 689 36 (2017)
https://doi.org/10.1016/j.tcs.2017.05.008

Uniform Kernelization Complexity of Hitting Forbidden Minors

Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov and Saket Saurabh
ACM Transactions on Algorithms 13 (3) 1 (2017)
https://doi.org/10.1145/3029051

Linear kernels for k-tuple and liar’s domination in bounded genus graphs

Arijit Bishnu, Arijit Ghosh and Subhabrata Paul
Discrete Applied Mathematics 231 67 (2017)
https://doi.org/10.1016/j.dam.2016.06.008

Combinatorial Optimization and Applications

Raquel Águeda, Nathann Cohen, Shinya Fujita, et al.
Lecture Notes in Computer Science, Combinatorial Optimization and Applications 10043 241 (2016)
https://doi.org/10.1007/978-3-319-48749-6_18

Partitioning a graph into disjoint cliques and a triangle-free graph

Faisal N. Abu-Khzam, Carl Feghali and Haiko Müller
Discrete Applied Mathematics 190-191 1 (2015)
https://doi.org/10.1016/j.dam.2015.03.015

Large Induced Subgraphs via Triangulations and CMSO

Fedor V. Fomin, Ioan Todinca and Yngve Villanger
SIAM Journal on Computing 44 (1) 54 (2015)
https://doi.org/10.1137/140964801

Handbook of Graph Theory, Second Edition

Richard Borie, R Parker and Craig Tovey
Discrete Mathematics and Its Applications, Handbook of Graph Theory, Second Edition 20134658 101 (2013)
https://doi.org/10.1201/b16132-11

LATIN 2012: Theoretical Informatics

Fedor V. Fomin, Serge Gaspers, Petr Golovach, et al.
Lecture Notes in Computer Science, LATIN 2012: Theoretical Informatics 7256 350 (2012)
https://doi.org/10.1007/978-3-642-29344-3_30

Parameterized Complexity of the Spanning Tree Congestion Problem

Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi and Erik Jan van Leeuwen
Algorithmica 64 (1) 85 (2012)
https://doi.org/10.1007/s00453-011-9565-7

Complexity and approximation of the Constrained Forest problem

Cristina Bazgan, Basile Couëtoux and Zsolt Tuza
Theoretical Computer Science 412 (32) 4081 (2011)
https://doi.org/10.1016/j.tcs.2010.07.018

Exakte Algorithmen für schwere Graphenprobleme

Frank Gurski, Irene Rothe, Jörg Rothe and Egon Wanke
eXamen.press, Exakte Algorithmen für schwere Graphenprobleme 259 (2010)
https://doi.org/10.1007/978-3-642-04500-4_10

Satisfactory graph partition, variants, and generalizations

Cristina Bazgan, Zsolt Tuza and Daniel Vanderpooten
European Journal of Operational Research 206 (2) 271 (2010)
https://doi.org/10.1016/j.ejor.2009.10.019

Graph Theoretic Concepts in Computer Science

Yota Otachi, Hans L. Bodlaender and Erik Jan van Leeuwen
Lecture Notes in Computer Science, Graph Theoretic Concepts in Computer Science 6410 3 (2010)
https://doi.org/10.1007/978-3-642-16926-7_3

Intractability of Clique-Width Parameterizations

Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov and Saket Saurabh
SIAM Journal on Computing 39 (5) 1941 (2010)
https://doi.org/10.1137/080742270

Graph-Theoretic Concepts in Computer Science

Jiří Fiala and Petr A. Golovach
Lecture Notes in Computer Science, Graph-Theoretic Concepts in Computer Science 5344 134 (2008)
https://doi.org/10.1007/978-3-540-92248-3_13

Degree-constrained decompositions of graphs: Bounded treewidth and planarity

Cristina Bazgan, Zsolt Tuza and Daniel Vanderpooten
Theoretical Computer Science 355 (3) 389 (2006)
https://doi.org/10.1016/j.tcs.2006.01.024

Automata-based Representations for Infinite Graphs

Salvatore La Torre and Margherita Napoli
RAIRO - Theoretical Informatics and Applications 35 (4) 311 (2001)
https://doi.org/10.1051/ita:2001122

Mathematical Foundations of Computer Science 1998

Klaus Barthelmann
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 1998 1450 543 (1998)
https://doi.org/10.1007/BFb0055804

Mathematical Foundations of Computer Science 1998

Salvatore La Torre and Margherita Napoli
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 1998 1450 571 (1998)
https://doi.org/10.1007/BFb0055807

Graph Grammars and Their Application to Computer Science

Stefan Arnborg and Andrzej Proskurowski
Lecture Notes in Computer Science, Graph Grammars and Their Application to Computer Science 1073 469 (1996)
https://doi.org/10.1007/3-540-61228-9_106

Characterization and complexity of uniformly nonprimitive labeled 2-structures

J. Engelfriet, T. Harju, A. Proskurowski and G. Rozenberg
Theoretical Computer Science 154 (2) 247 (1996)
https://doi.org/10.1016/0304-3975(94)00272-X

Equivalent definitions of recognizability for sets of graphs of bounded tree-width

Bruno Courcelle and Jens Lagergren
Mathematical Structures in Computer Science 6 (2) 141 (1996)
https://doi.org/10.1017/S096012950000092X

Graph Grammars and Their Application to Computer Science

B. Courcelle and G. Sénizergues
Lecture Notes in Computer Science, Graph Grammars and Their Application to Computer Science 1073 351 (1996)
https://doi.org/10.1007/3-540-61228-9_98

A logical characterization of the sets of hypergraphs defined by Hyperedge Replacement grammars

B. Courcelle and J. Engelfriet
Mathematical Systems Theory 28 (6) 515 (1995)
https://doi.org/10.1007/BF01204169

Graph Transformations in Computer Science

Bruno Courcelle and Jens Lagergren
Lecture Notes in Computer Science, Graph Transformations in Computer Science 776 138 (1994)
https://doi.org/10.1007/3-540-57787-4_9