Search for persons
X
?
Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science ,
1
Cutting Barnette Graphs Perfectly is Hard:
, In:
?
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science ,
2
Model Checking on Interpretations of Classes of Bounded Loc..:
, In:
?
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing ,
3
Twin-width IV: ordered graphs and matrices:
, In:
?
Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms ,
4
Twin-width II : small classes:
, In:
?
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) ,
5
Twin-width II: small classes:
, In:
?
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) ,
6
Twin-width I: tractable FO model checking:
, In:
?
Lecture Notes in Computer Science; Analysis of Experimental Algorithms ,
7
Constraint Generation Algorithm for the Minimum Connectivit..:
, In:
?
Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science ,
8