×

Found 66 Documents (Results 1–66)

Newest Citations Relevance
Bonnet, Édouard; Giocanti, Ugo; Ossona de Mendez, Patrice; Simon, Pierre; Thomassé, Stéphan; Toruńczyk, Szymon

Twin-width. IV: Ordered graphs and matrices. (English) Zbl 07774389

Leonardi, Stefano (ed.) et al., Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC ’22, Rome, Italy June 20–24, 2022. New York, NY: Association for Computing Machinery (ACM). 924-937 (2022).
MSC:  68Qxx
Cite Review PDF
Full Text: DOI arXiv HAL
Fomin, Fedor V.; Golovach, Petr A.; Stamoulis, Giannos; Thilikos, Dimitrios M.

An algorithmic meta-theorem for graph modification to planarity and FOL. (English) Zbl 07651190

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 51, 17 p. (2020).
MSC:  68Wxx
Cite Review PDF
Full Text: DOI arXiv
Dreier, Jan; Kuinke, Philipp; Rossmanith, Peter

First-order model-checking in random graphs and complex networks. (English) Zbl 07651179

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 40, 23 p. (2020).
MSC:  68Wxx
Cite Review PDF
Full Text: DOI arXiv
Gajarský, Jakub; Král’, Daniel

Recovering sparse graphs. (English) Zbl 1512.68152

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 29, 15 p. (2018).
MSC:  68Q60 68Q27 68R10 68W05
Cite Review PDF
Full Text: DOI arXiv
Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Zehavi, Meirav

Reducing CMSO model checking to highly connected graphs. (English) Zbl 1499.68203

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 135, 14 p. (2018).
MSC:  68Q60 03B70 68Q27 68R10
Cite Review PDF
Full Text: DOI arXiv
Kuske, Dietrich; Schweikardt, Nicole

Gaifman normal forms for counting extensions of first-order logic. (English) Zbl 1499.03028

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 133, 14 p. (2018).
MSC:  03C13 03C07 03C80 68Q27 68Q60
Cite Review PDF
Full Text: DOI
Gajarský, Jakub; Kreutzer, Stephan; Nešetřil, Jaroslav; Ossona de Mendez, Patrice; Pilipczuk, Michal; Siebertz, Sebastian; Toruńczyk, Szymon

First-order interpretations of bounded expansion classes. (English) Zbl 1499.68202

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 126, 14 p. (2018).
MSC:  68Q60 03B70 05C75
Cite Review PDF
Full Text: DOI
Hliněný, Petr; Pokrývka, Filip; Roy, Bodhayan

FO model checking of geometric graphs. (English) Zbl 1443.68105

Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 19, 12 p. (2018).
MSC:  68Q60 03B10 05C62 68Q27 68R10
Cite Review PDF
Full Text: DOI
Gajarský, J.; Hliněný, P.; Obdržálek, J.; Lokshtanov, D.; Ramanujan, M. S.

A new perspective on FO model checking of dense graph classes. (English) Zbl 1401.68196

Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 176-184 (2016).
MSC:  68Q60 03B70 05C75 68Q25
Cite Review PDF
Full Text: DOI arXiv
Eickmeyer, Kord; Kawarabayashi, Ken-Ichi; Kreutzer, Stephan

Model checking for successor-invariant first-order logic on minor-closed graph classes. (English) Zbl 1366.68168

Proceedings of the 2013 28th annual ACM/IEEE symposium on logic in computer science, LICS 2013, Tulane University, New Orleans, LA, USA, June 25–28, 2013. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-5020-6). 134-142 (2013).
MSC:  68Q60 03B70 05C75 05C83 68Q25
Cite Review PDF
Full Text: DOI
Heimberg, Lucas; Kuske, Dietrich; Schweikardt, Nicole

An optimal Gaifman normal form construction for structures of bounded degree. (English) Zbl 1366.03212

Proceedings of the 2013 28th annual ACM/IEEE symposium on logic in computer science, LICS 2013, Tulane University, New Orleans, LA, USA, June 25–28, 2013. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-5020-6). 63-72 (2013).
MSC:  03C13 03B10 03B70 68Q19
Cite Review PDF
Full Text: DOI
Engelmann, Viktor; Kreutzer, Stephan; Siebertz, Sebastian

First-order and monadic second-order model-checking on ordered structures. (English) Zbl 1362.68167

Proceedings of the 2012 27th annual ACM/IEEE symposium on logic in computer science, LICS 2012, Dubrovnik, Croatia, June 25–28, 2012. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-4769-5). 275-284 (2012).
MSC:  68Q60 03B10 03B15 03C07 03C13 68Q19 68Q25
Cite Review PDF
Full Text: DOI
Kreutzer, Stephan

On the parameterised intractability of monadic second-order logic. (English) Zbl 1257.68070

Grädel, Erich (ed.) et al., Computer science logic. 23rd international workshop, CSL 2009, 18th annual conference of the EACSL, Coimbra, Portugal, September 7–11, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04026-9/pbk). Lecture Notes in Computer Science 5771, 348-363 (2009).
MSC:  68Q15 03B15 68Q60
Cite Review PDF
Full Text: DOI
Yao, Hongliang; Chang, Jian; Jiang, Caizi; Wang, Hao

Junction tree factored particle inference algorithm for multi-agent dynamic influence diagrams. (English) Zbl 1248.68424

Deng, Xiaotie (ed.) et al., Frontiers in algorithmics. Third international workshop, FAW 2009, Hefei, China, June 20–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02269-2/pbk). Lecture Notes in Computer Science 5598, 228-236 (2009).
MSC:  68T05 68T42
Cite Review PDF
Full Text: DOI
Courcelle, Bruno; Gavoille, Cyril; Kanté, Mamadou Moustapha

Efficient first-order model-checking using short labels. (English) Zbl 1143.68448

Preparata, Franco P. (ed.) et al., Frontiers in algorithmics. Second annual international workshop, FAW 2008, Changsha, China, June 19–21, 2008. Proceeedings. Berlin: Springer (ISBN 978-3-540-69310-9/pbk). Lecture Notes in Computer Science 5059, 159-170 (2008).
MSC:  68Q60 68Q25 68R10
Cite Review PDF
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software