Bonnet, Édouard
8  results:
Search for persons X
?
1

Cutting Barnette Graphs Perfectly is Hard:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
 
?
2

Model Checking on Interpretations of Classes of Bounded Loc..:

, In: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science,
 
?
3

Twin-width IV: ordered graphs and matrices:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
 
?
4

Twin-width II : small classes:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Bonnet, Édouard ; Geniet, Colin ; Kim, Eun Jung.. - p. 1977-1996 , 2021
 
?
5

Twin-width II: small classes:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Bonnet, Édouard ; Geniet, Colin ; Kim, Eun Jung.. - p. 1977-1996 , 2021
 
?
6

Twin-width I: tractable FO model checking:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
 
?
7

Constraint Generation Algorithm for the Minimum Connectivit..:

, In: Lecture Notes in Computer Science; Analysis of Experimental Algorithms,
 
?
8

Optimality Program in Segment and String Graphs:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
 
1-8