| Twin-width IV: ordered graphs and matrices É Bonnet, U Giocanti, PO de Mendez, P Simon, S Thomassé, S Toruńczyk Journal of the ACM 71 (3), 1-45, 2024 | 120* | 2024 |
| Energy and mean-payoff games with imperfect information A Degorre, L Doyen, R Gentilini, JF Raskin, S Toruńczyk International Workshop on Computer Science Logic, 260-274, 2010 | 103 | 2010 |
| First-Order Interpretations of Bounded Expansion Classes J Gajarsky, S Kreutzer, J Nesetril, P Ossona de Mendez, M Pilipczuk, ... 45th International Colloquium on Automata, Languages, and Programming …, 2018 | 83 | 2018 |
| Turing machines with atoms M Bojanczyk, B Klin, S Lasota, S Torunczyk 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 183-192, 2013 | 68 | 2013 |
| Weak MSO+ U over infinite trees M Bojanczyk, S Torunczyk STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 648-660, 2012 | 62 | 2012 |
| Stable graphs of bounded twin-width J Gajarský, M Pilipczuk, S Toruńczyk Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022 | 43 | 2022 |
| On the number of types in sparse graphs M Pilipczuk, S Siebertz, S Toruńczyk Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018 | 42* | 2018 |
| Automata based verification over linearly ordered data domains L Segoufin, S Toruńczyk Symposium on Theoretical Aspects of Computer Science (STACS2011) 9, 81-92, 2011 | 42 | 2011 |
| The MSO+U Theory of (N,<) Is Undecidable M Bojanczyk, P Parys, S Toruńczyk Symposium on Theoretical Aspects of Computer Science (STACS2016) 47, 21:1--21:8, 2016 | 36* | 2016 |
| Verification of database-driven systems via amalgamation M Bojańczyk, L Segoufin, S Toruńczyk Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of …, 2013 | 35 | 2013 |
| Flip-width: Cops and robber on dense graphs S Toruńczyk 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 33 | 2023 |
| Progressive algorithms for domination and independence G Fabiański, M Pilipczuk, S Siebertz, S Toruńczyk arXiv preprint arXiv:1811.06799, 2018 | 31 | 2018 |
| Languages of profinite words and the limitedness problem S Toruńczyk PhD thesis, Warsaw University, 2011 | 31 | 2011 |
| Deterministic automata and extensions of weak mso M Bojanczyk, S Torunczyk IARCS Annual Conference on Foundations of Software Technology and …, 2009 | 30 | 2009 |
| Imperative programming in sets with atoms M Bojanczyk, S Torunczyk IARCS Annual Conference on Foundations of Software Technology and …, 2012 | 27 | 2012 |
| First-order model checking on monadically stable graph classes J Dreier, I Eleftheriadis, N Mählmann, R McCarty, M Pilipczuk, ... 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 21-30, 2024 | 25 | 2024 |
| LOIS: syntax and semantics E Kopczyński, S Toruńczyk ACM SIGPLAN Notices 52 (1), 586-598, 2017 | 25 | 2017 |
| Locally finite constraint satisfaction problems B Klin, E Kopczynski, J Ochremiak, S Torunczyk 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 475-486, 2015 | 25 | 2015 |
| Model checking on interpretations of classes of bounded local cliquewidth É Bonnet, J Dreier, J Gajarský, S Kreutzer, N Mählmann, P Simon, ... Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022 | 23 | 2022 |
| Algorithms and data structures for first-order logic with connectivity under vertex failures M Pilipczuk, N Schirrmacher, S Siebertz, S Toruńczyk, A Vigny arXiv preprint arXiv:2111.03725, 2021 | 23 | 2021 |
Michał PilipczukUniversity of WarsawVerified email at mimuw.edu.pl
