Courcelle's theorem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Courcelle's theorem" in English language version.

refsWebsite

Global rank English rank

22doi.org

2^nd place

10ams.org

451^st place

277^th place

9semanticscholar.org

11^th place

8^th place

7psu.edu

207^th place

136^th place

4zbmath.org

1,923^rd place

1,068^th place

4arxiv.org

69^th place

59^th place

3harvard.edu

18^th place

17^th place

1archives-ouvertes.fr

1,031^st place

879^th place

1books.google.com

3^rd place

1tum.de

7,448^th place

9,770^th place

1kaist.ac.kr

low place

1soton.ac.uk

6,219^th place

4,029^th place

ams.org

mathscinet.ams.org

Downey, Rodney G.; Fellows, Michael R. (2013), "Chapter 13: Courcelle's theorem", Fundamentals of parameterized complexity, Texts in Computer Science, London: Springer, pp. 265–278, CiteSeerX 10.1.1.456.2729, doi:10.1007/978-1-4471-5559-1, ISBN 978-1-4471-5558-4, MR 3154461, S2CID 23517218.
Courcelle, Bruno (1990), "The monadic second-order logic of graphs. I. Recognizable sets of finite graphs", Information and Computation, 85 (1): 12–75, doi:10.1016/0890-5401(90)90043-H, MR 1042649, Zbl 0722.03008
Borie, Richard B.; Parker, R. Gary; Tovey, Craig A. (1992), "Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families", Algorithmica, 7 (5–6): 555–581, doi:10.1007/BF01758777, MR 1154588, S2CID 22623740.
Courcelle, B.; Makowsky, J. A.; Rotics, U. (2000), "Linear time solvable optimization problems on graphs of bounded clique-width", Theory of Computing Systems, 33 (2): 125–150, CiteSeerX 10.1.1.414.1845, doi:10.1007/s002249910009, MR 1739644, S2CID 15402031, Zbl 1009.68102.
Oum, Sang-il; Seymour, Paul (2006), "Approximating clique-width and branch-width", Journal of Combinatorial Theory, Series B, 96 (4): 514–528, doi:10.1016/j.jctb.2005.10.006, MR 2232389.
Arnborg, Stefan; Lagergren, Jens; Seese, Detlef (1991), "Easy problems for tree-decomposable graphs", Journal of Algorithms, 12 (2): 308–340, CiteSeerX 10.1.1.12.2544, doi:10.1016/0196-6774(91)90006-K, MR 1105479.
Frick, Markus; Grohe, Martin (2004), "The complexity of first-order and monadic second-order logic revisited", Annals of Pure and Applied Logic, 130 (1–3): 3–31, CiteSeerX 10.1.1.104.8429, doi:10.1016/j.apal.2004.01.007, MR 2092847.
Seese, D. (1991), "The structure of the models of decidable monadic theories of graphs", Annals of Pure and Applied Logic, 53 (2): 169–195, doi:10.1016/0168-0072(91)90054-P, MR 1114848.
Courcelle, Bruno; Oum, Sang-il (2007), "Vertex-minors, monadic second-order logic, and a conjecture by Seese" (PDF), Journal of Combinatorial Theory, Series B, 97 (1): 91–126, doi:10.1016/j.jctb.2006.04.003, MR 2278126.
Gottlob, Georg; Lee, Stephanie Tien (2007), "A logical approach to multicut problems", Information Processing Letters, 103 (4): 136–141, doi:10.1016/j.ipl.2007.03.005, MR 2330167.

archives-ouvertes.fr

hal.archives-ouvertes.fr

Courcelle, Bruno; Engelfriet, Joost (2012), Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach (PDF), Encyclopedia of Mathematics and its Applications, vol. 138, Cambridge University Press, ISBN 9781139644006, Zbl 1257.68006.

arxiv.org

Jaffke, Lars; Bodlaender, Hans L. (2015), MSOL-definability equals recognizability for Halin graphs and bounded degree $k$ -outerplanar graphs, arXiv:1503.01604, Bibcode:2015arXiv150301604J.
Bojańczyk, Mikołaj; Pilipczuk, Michał (2016), "Definability equals recognizability for graphs of bounded treewidth", Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2016), pp. 407–416, arXiv:1605.03045, doi:10.1145/2933575.2934508, ISBN 978-1-4503-4391-6, S2CID 1213054.
Grohe, Martin (2001), "Computing crossing numbers in quadratic time", Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing (STOC '01), pp. 231–236, arXiv:cs/0009010, doi:10.1145/380752.380805, ISBN 1-58113-349-9, S2CID 724544.
Burton, Benjamin A.; Downey, Rodney G. (2014), Courcelle's theorem for triangulations, arXiv:1403.2926, Bibcode:2014arXiv1403.2926B. Short communication, International Congress of Mathematicians, 2014.

books.google.com

Courcelle & Engelfriet (2012), Proposition 5.13, p. 338.

doi.org

Downey, Rodney G.; Fellows, Michael R. (2013), "Chapter 13: Courcelle's theorem", Fundamentals of parameterized complexity, Texts in Computer Science, London: Springer, pp. 265–278, CiteSeerX 10.1.1.456.2729, doi:10.1007/978-1-4471-5559-1, ISBN 978-1-4471-5558-4, MR 3154461, S2CID 23517218.
Courcelle, Bruno (1990), "The monadic second-order logic of graphs. I. Recognizable sets of finite graphs", Information and Computation, 85 (1): 12–75, doi:10.1016/0890-5401(90)90043-H, MR 1042649, Zbl 0722.03008
Borie, Richard B.; Parker, R. Gary; Tovey, Craig A. (1992), "Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families", Algorithmica, 7 (5–6): 555–581, doi:10.1007/BF01758777, MR 1154588, S2CID 22623740.
Kneis, Joachim; Langer, Alexander (2009), "A practical approach to Courcelle's theorem", Electronic Notes in Theoretical Computer Science, 251: 65–81, doi:10.1016/j.entcs.2009.08.028.
Lampis, Michael (2010), "Algorithmic meta-theorems for restrictions of treewidth", in de Berg, Mark; Meyer, Ulrich (eds.), Proc. 18th Annual European Symposium on Algorithms, Lecture Notes in Computer Science, vol. 6346, Springer, pp. 549–560, doi:10.1007/978-3-642-15775-2_47, ISBN 978-3-642-15774-5, Zbl 1287.68078.
Courcelle, B.; Makowsky, J. A.; Rotics, U. (2000), "Linear time solvable optimization problems on graphs of bounded clique-width", Theory of Computing Systems, 33 (2): 125–150, CiteSeerX 10.1.1.414.1845, doi:10.1007/s002249910009, MR 1739644, S2CID 15402031, Zbl 1009.68102.
Oum, Sang-il; Seymour, Paul (2006), "Approximating clique-width and branch-width", Journal of Combinatorial Theory, Series B, 96 (4): 514–528, doi:10.1016/j.jctb.2005.10.006, MR 2232389.
Arnborg, Stefan; Lagergren, Jens; Seese, Detlef (1991), "Easy problems for tree-decomposable graphs", Journal of Algorithms, 12 (2): 308–340, CiteSeerX 10.1.1.12.2544, doi:10.1016/0196-6774(91)90006-K, MR 1105479.
Elberfeld, Michael; Jakoby, Andreas; Tantau, Till (October 2010), "Logspace Versions of the Theorems of Bodlaender and Courcelle" (PDF), Proc. 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010), pp. 143–152, doi:10.1109/FOCS.2010.21, ISBN 978-1-4244-8525-3, S2CID 1820251.
Frick, Markus; Grohe, Martin (2004), "The complexity of first-order and monadic second-order logic revisited", Annals of Pure and Applied Logic, 130 (1–3): 3–31, CiteSeerX 10.1.1.104.8429, doi:10.1016/j.apal.2004.01.007, MR 2092847.
Lapoire, Denis (1998), "Recognizability equals monadic second-order definability for sets of graphs of bounded tree-width", STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science Paris, France, February 27, 1998, Proceedings, Lecture Notes in Computer Science, vol. 1373, pp. 618–628, Bibcode:1998LNCS.1373..618L, CiteSeerX 10.1.1.22.7805, doi:10.1007/bfb0028596, ISBN 978-3-540-64230-5.
Kaller, D. (2000), "Definability equals recognizability of partial 3-trees and $k$ -connected partial $k$ -trees", Algorithmica, 27 (3): 348–381, doi:10.1007/s004530010024, S2CID 39798483.
Bojańczyk, Mikołaj; Pilipczuk, Michał (2016), "Definability equals recognizability for graphs of bounded treewidth", Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2016), pp. 407–416, arXiv:1605.03045, doi:10.1145/2933575.2934508, ISBN 978-1-4503-4391-6, S2CID 1213054.
Seese, D. (1991), "The structure of the models of decidable monadic theories of graphs", Annals of Pure and Applied Logic, 53 (2): 169–195, doi:10.1016/0168-0072(91)90054-P, MR 1114848.
Courcelle, Bruno; Oum, Sang-il (2007), "Vertex-minors, monadic second-order logic, and a conjecture by Seese" (PDF), Journal of Combinatorial Theory, Series B, 97 (1): 91–126, doi:10.1016/j.jctb.2006.04.003, MR 2278126.
Grohe, Martin (2001), "Computing crossing numbers in quadratic time", Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing (STOC '01), pp. 231–236, arXiv:cs/0009010, doi:10.1145/380752.380805, ISBN 1-58113-349-9, S2CID 724544.
Kawarabayashi, Ken-ichi; Reed, Bruce (2007), "Computing crossing number in linear time", Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing (STOC '07), pp. 382–390, doi:10.1145/1250790.1250848, ISBN 978-1-59593-631-8, S2CID 13000831.
Gottlob, Georg; Lee, Stephanie Tien (2007), "A logical approach to multicut problems", Information Processing Letters, 103 (4): 136–141, doi:10.1016/j.ipl.2007.03.005, MR 2330167.
Grohe, Martin; Mariño, Julian (1999), "Definability and descriptive complexity on databases of bounded tree-width", Database Theory — ICDT'99: 7th International Conference Jerusalem, Israel, January 10–12, 1999, Proceedings, Lecture Notes in Computer Science, vol. 1540, pp. 70–82, CiteSeerX 10.1.1.52.2984, doi:10.1007/3-540-49257-7_6, ISBN 978-3-540-65452-0.
Gottlob, Georg; Pichler, Reinhard; Wei, Fang (January 2010), "Bounded treewidth as a key to tractability of knowledge representation and reasoning", Artificial Intelligence, 174 (1): 105–132, doi:10.1016/j.artint.2009.10.003.
Madhusudan, P.; Parlato, Gennaro (2011), "The Tree Width of Auxiliary Storage", Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '11) (PDF), SIGPLAN Notices, vol. 46, pp. 283–294, doi:10.1145/1926385.1926419, ISBN 978-1-4503-0490-0, S2CID 6976816
Obdržálek, Jan (2003), "Fast mu-calculus model checking when tree-width is bounded", Computer Aided Verification: 15th International Conference, CAV 2003, Boulder, CO, USA, July 8-12, 2003, Proceedings, Lecture Notes in Computer Science, vol. 2725, pp. 80–92, CiteSeerX 10.1.1.2.4843, doi:10.1007/978-3-540-45069-6_7, ISBN 978-3-540-40524-5.

harvard.edu

ui.adsabs.harvard.edu

Lapoire, Denis (1998), "Recognizability equals monadic second-order definability for sets of graphs of bounded tree-width", STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science Paris, France, February 27, 1998, Proceedings, Lecture Notes in Computer Science, vol. 1373, pp. 618–628, Bibcode:1998LNCS.1373..618L, CiteSeerX 10.1.1.22.7805, doi:10.1007/bfb0028596, ISBN 978-3-540-64230-5.
Jaffke, Lars; Bodlaender, Hans L. (2015), MSOL-definability equals recognizability for Halin graphs and bounded degree $k$ -outerplanar graphs, arXiv:1503.01604, Bibcode:2015arXiv150301604J.
Burton, Benjamin A.; Downey, Rodney G. (2014), Courcelle's theorem for triangulations, arXiv:1403.2926, Bibcode:2014arXiv1403.2926B. Short communication, International Congress of Mathematicians, 2014.

kaist.ac.kr

mathsci.kaist.ac.kr

Courcelle, Bruno; Oum, Sang-il (2007), "Vertex-minors, monadic second-order logic, and a conjecture by Seese" (PDF), Journal of Combinatorial Theory, Series B, 97 (1): 91–126, doi:10.1016/j.jctb.2006.04.003, MR 2278126.

psu.edu

citeseerx.ist.psu.edu

Downey, Rodney G.; Fellows, Michael R. (2013), "Chapter 13: Courcelle's theorem", Fundamentals of parameterized complexity, Texts in Computer Science, London: Springer, pp. 265–278, CiteSeerX 10.1.1.456.2729, doi:10.1007/978-1-4471-5559-1, ISBN 978-1-4471-5558-4, MR 3154461, S2CID 23517218.
Courcelle, B.; Makowsky, J. A.; Rotics, U. (2000), "Linear time solvable optimization problems on graphs of bounded clique-width", Theory of Computing Systems, 33 (2): 125–150, CiteSeerX 10.1.1.414.1845, doi:10.1007/s002249910009, MR 1739644, S2CID 15402031, Zbl 1009.68102.
Arnborg, Stefan; Lagergren, Jens; Seese, Detlef (1991), "Easy problems for tree-decomposable graphs", Journal of Algorithms, 12 (2): 308–340, CiteSeerX 10.1.1.12.2544, doi:10.1016/0196-6774(91)90006-K, MR 1105479.
Frick, Markus; Grohe, Martin (2004), "The complexity of first-order and monadic second-order logic revisited", Annals of Pure and Applied Logic, 130 (1–3): 3–31, CiteSeerX 10.1.1.104.8429, doi:10.1016/j.apal.2004.01.007, MR 2092847.
Lapoire, Denis (1998), "Recognizability equals monadic second-order definability for sets of graphs of bounded tree-width", STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science Paris, France, February 27, 1998, Proceedings, Lecture Notes in Computer Science, vol. 1373, pp. 618–628, Bibcode:1998LNCS.1373..618L, CiteSeerX 10.1.1.22.7805, doi:10.1007/bfb0028596, ISBN 978-3-540-64230-5.
Grohe, Martin; Mariño, Julian (1999), "Definability and descriptive complexity on databases of bounded tree-width", Database Theory — ICDT'99: 7th International Conference Jerusalem, Israel, January 10–12, 1999, Proceedings, Lecture Notes in Computer Science, vol. 1540, pp. 70–82, CiteSeerX 10.1.1.52.2984, doi:10.1007/3-540-49257-7_6, ISBN 978-3-540-65452-0.
Obdržálek, Jan (2003), "Fast mu-calculus model checking when tree-width is bounded", Computer Aided Verification: 15th International Conference, CAV 2003, Boulder, CO, USA, July 8-12, 2003, Proceedings, Lecture Notes in Computer Science, vol. 2725, pp. 80–92, CiteSeerX 10.1.1.2.4843, doi:10.1007/978-3-540-45069-6_7, ISBN 978-3-540-40524-5.

semanticscholar.org

api.semanticscholar.org

Downey, Rodney G.; Fellows, Michael R. (2013), "Chapter 13: Courcelle's theorem", Fundamentals of parameterized complexity, Texts in Computer Science, London: Springer, pp. 265–278, CiteSeerX 10.1.1.456.2729, doi:10.1007/978-1-4471-5559-1, ISBN 978-1-4471-5558-4, MR 3154461, S2CID 23517218.
Borie, Richard B.; Parker, R. Gary; Tovey, Craig A. (1992), "Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families", Algorithmica, 7 (5–6): 555–581, doi:10.1007/BF01758777, MR 1154588, S2CID 22623740.
Courcelle, B.; Makowsky, J. A.; Rotics, U. (2000), "Linear time solvable optimization problems on graphs of bounded clique-width", Theory of Computing Systems, 33 (2): 125–150, CiteSeerX 10.1.1.414.1845, doi:10.1007/s002249910009, MR 1739644, S2CID 15402031, Zbl 1009.68102.
Elberfeld, Michael; Jakoby, Andreas; Tantau, Till (October 2010), "Logspace Versions of the Theorems of Bodlaender and Courcelle" (PDF), Proc. 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010), pp. 143–152, doi:10.1109/FOCS.2010.21, ISBN 978-1-4244-8525-3, S2CID 1820251.
Kaller, D. (2000), "Definability equals recognizability of partial 3-trees and $k$ -connected partial $k$ -trees", Algorithmica, 27 (3): 348–381, doi:10.1007/s004530010024, S2CID 39798483.
Bojańczyk, Mikołaj; Pilipczuk, Michał (2016), "Definability equals recognizability for graphs of bounded treewidth", Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2016), pp. 407–416, arXiv:1605.03045, doi:10.1145/2933575.2934508, ISBN 978-1-4503-4391-6, S2CID 1213054.
Grohe, Martin (2001), "Computing crossing numbers in quadratic time", Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing (STOC '01), pp. 231–236, arXiv:cs/0009010, doi:10.1145/380752.380805, ISBN 1-58113-349-9, S2CID 724544.
Kawarabayashi, Ken-ichi; Reed, Bruce (2007), "Computing crossing number in linear time", Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing (STOC '07), pp. 382–390, doi:10.1145/1250790.1250848, ISBN 978-1-59593-631-8, S2CID 13000831.
Madhusudan, P.; Parlato, Gennaro (2011), "The Tree Width of Auxiliary Storage", Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '11) (PDF), SIGPLAN Notices, vol. 46, pp. 283–294, doi:10.1145/1926385.1926419, ISBN 978-1-4503-0490-0, S2CID 6976816

soton.ac.uk

eprints.soton.ac.uk

Madhusudan, P.; Parlato, Gennaro (2011), "The Tree Width of Auxiliary Storage", Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '11) (PDF), SIGPLAN Notices, vol. 46, pp. 283–294, doi:10.1145/1926385.1926419, ISBN 978-1-4503-0490-0, S2CID 6976816

tum.de

wwwmayr.in.tum.de

Elberfeld, Michael; Jakoby, Andreas; Tantau, Till (October 2010), "Logspace Versions of the Theorems of Bodlaender and Courcelle" (PDF), Proc. 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010), pp. 143–152, doi:10.1109/FOCS.2010.21, ISBN 978-1-4244-8525-3, S2CID 1820251.

zbmath.org

Courcelle, Bruno; Engelfriet, Joost (2012), Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach (PDF), Encyclopedia of Mathematics and its Applications, vol. 138, Cambridge University Press, ISBN 9781139644006, Zbl 1257.68006.
Courcelle, Bruno (1990), "The monadic second-order logic of graphs. I. Recognizable sets of finite graphs", Information and Computation, 85 (1): 12–75, doi:10.1016/0890-5401(90)90043-H, MR 1042649, Zbl 0722.03008
Lampis, Michael (2010), "Algorithmic meta-theorems for restrictions of treewidth", in de Berg, Mark; Meyer, Ulrich (eds.), Proc. 18th Annual European Symposium on Algorithms, Lecture Notes in Computer Science, vol. 6346, Springer, pp. 549–560, doi:10.1007/978-3-642-15775-2_47, ISBN 978-3-642-15774-5, Zbl 1287.68078.
Courcelle, B.; Makowsky, J. A.; Rotics, U. (2000), "Linear time solvable optimization problems on graphs of bounded clique-width", Theory of Computing Systems, 33 (2): 125–150, CiteSeerX 10.1.1.414.1845, doi:10.1007/s002249910009, MR 1739644, S2CID 15402031, Zbl 1009.68102.