Article references

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:

Heuristic and metaheuristic methods for computing graph treewidth

François Clautiaux, Aziz Moukrim, Stéphane Nègre, Jacques Carlier

RAIRO-Oper. Res., 38 1 (2004) 13-26

Published online: 2004-04-15

DOI: https://doi.org/10.1051/ro:2004011

This article has been cited by the following article(s):

Tree decompositions of real-world networks from simulated annealing

Konstantin Klemm
Journal of Physics: Complexity 1 (3) 035003 (2020)
https://doi.org/10.1088/2632-072X/ab9d2f

Learning tractable Bayesian networks in the space of elimination orders

Marco Benjumeda, Concha Bielza and Pedro Larrañaga
Artificial Intelligence 274 66 (2019)
https://doi.org/10.1016/j.artint.2018.11.007

Tractability of most probable explanations in multidimensional Bayesian network classifiers

Marco Benjumeda, Concha Bielza and Pedro Larrañaga
International Journal of Approximate Reasoning 93 74 (2018)
https://doi.org/10.1016/j.ijar.2017.10.024

Integration of AI and OR Techniques in Constraint Programming

Michael Abseher, Nysret Musliu and Stefan Woltran
Lecture Notes in Computer Science, Integration of AI and OR Techniques in Constraint Programming 10335 376 (2017)
https://doi.org/10.1007/978-3-319-59776-8_30

Springer Handbook of Computational Intelligence

Thomas Hammerl, Nysret Musliu and Werner Schafhauser
Springer Handbook of Computational Intelligence 1255 (2015)
https://doi.org/10.1007/978-3-662-43505-2_64

Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization

Hans L. Bodlaender, Bart M. P. Jansen and Stefan Kratsch
SIAM Journal on Discrete Mathematics 27 (4) 2108 (2013)
https://doi.org/10.1137/120903518

A Note on Exact Algorithms for Vertex Ordering Problems on Graphs

Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch and Dimitrios M. Thilikos
Theory of Computing Systems 50 (3) 420 (2012)
https://doi.org/10.1007/s00224-011-9312-0

On exact algorithms for treewidth

Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch and Dimitrios M. Thilikos
ACM Transactions on Algorithms 9 (1) 1 (2012)
https://doi.org/10.1145/2390176.2390188

SOFSEM 2011: Theory and Practice of Computer Science

Arnold Overwijk, Eelko Penninkx and Hans L. Bodlaender
Lecture Notes in Computer Science, SOFSEM 2011: Theory and Practice of Computer Science 6543 444 (2011)
https://doi.org/10.1007/978-3-642-18381-2_37

Automata, Languages and Programming

Hans L. Bodlaender, Bart M. P. Jansen and Stefan Kratsch
Lecture Notes in Computer Science, Automata, Languages and Programming 6755 437 (2011)
https://doi.org/10.1007/978-3-642-22006-7_37

Evolutionary Computation in Combinatorial Optimization

Thomas Hammerl and Nysret Musliu
Lecture Notes in Computer Science, Evolutionary Computation in Combinatorial Optimization 6022 95 (2010)
https://doi.org/10.1007/978-3-642-12139-5_9

Treewidth computations I. Upper bounds

Hans L. Bodlaender and Arie M.C.A. Koster
Information and Computation 208 (3) 259 (2010)
https://doi.org/10.1016/j.ic.2009.03.008

Solving problems on recursively constructed graphs

Richard B. Borie, R. Gary Parker and Craig A. Tovey
ACM Computing Surveys 41 (1) 1 (2009)
https://doi.org/10.1145/1456650.1456654

Treewidth Lower Bounds with Brambles

Hans L. Bodlaender, Alexander Grigoriev and Arie M. C. A. Koster
Algorithmica 51 (1) 81 (2008)
https://doi.org/10.1007/s00453-007-9056-z

Achievable sets, brambles, and sparse treewidth obstructions

Brian Lucena
Discrete Applied Mathematics 155 (8) 1055 (2007)
https://doi.org/10.1016/j.dam.2006.11.006

On the maximum cardinality search lower bound for treewidth

Hans L. Bodlaender and Arie M.C.A. Koster
Discrete Applied Mathematics 155 (11) 1348 (2007)
https://doi.org/10.1016/j.dam.2007.02.004

Tree decomposition and discrete optimization problems: A survey

O. A. Shcherbina
Cybernetics and Systems Analysis 43 (4) 549 (2007)
https://doi.org/10.1007/s10559-007-0080-4

Structural Information and Communication Complexity

Hans L. Bodlaender
Lecture Notes in Computer Science, Structural Information and Communication Complexity 4474 11 (2007)
https://doi.org/10.1007/978-3-540-72951-8_3

Evolutionary Computation in Combinatorial Optimization

Nysret Musliu
Lecture Notes in Computer Science, Evolutionary Computation in Combinatorial Optimization 4446 130 (2007)
https://doi.org/10.1007/978-3-540-71615-0_12

Algorithms – ESA 2006

Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch and Dimitrios M. Thilikos
Lecture Notes in Computer Science, Algorithms – ESA 2006 4168 672 (2006)
https://doi.org/10.1007/11841036_60

Algorithmic Aspects in Information and Management

Emgad H. Bachoore and Hans L. Bodlaender
Lecture Notes in Computer Science, Algorithmic Aspects in Information and Management 4041 255 (2006)
https://doi.org/10.1007/11775096_24

Graph-Theoretic Concepts in Computer Science

Hans L. Bodlaender
Lecture Notes in Computer Science, Graph-Theoretic Concepts in Computer Science 4271 1 (2006)
https://doi.org/10.1007/11917496_1

Algorithms – ESA 2005

Hans L. Bodlaender, Alexander Grigoriev and Arie M. C. A. Koster
Lecture Notes in Computer Science, Algorithms – ESA 2005 3669 391 (2005)
https://doi.org/10.1007/11561071_36

Experimental and Efficient Algorithms

Arie M. C. A. Koster, Thomas Wolle and Hans L. Bodlaender
Lecture Notes in Computer Science, Experimental and Efficient Algorithms 3503 101 (2005)
https://doi.org/10.1007/11427186_11

SOFSEM 2005: Theory and Practice of Computer Science

Hans L. Bodlaender
Lecture Notes in Computer Science, SOFSEM 2005: Theory and Practice of Computer Science 3381 1 (2005)
https://doi.org/10.1007/978-3-540-30577-4_1