Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by François Dross
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Related publications
Sparse Universal Graphs for Bounded-Degree Graphs
Random Structures and Algorithms
Mathematics
Applied Mathematics
Computer Graphics
Computer-Aided Design
Software
Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs
Computer Journal
Computer Science
Testing Expansion in Bounded-Degree Graphs
Flow-Cut Gaps and Face Covers in Planar Graphs
Distance Approximation in Bounded-Degree and General Sparse Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
The Degree/Diameter Problem in Maximal Planar Bipartite Graphs
Electronic Journal of Combinatorics
Combinatorics
Applied Mathematics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Topology
Theoretical Computer Science
Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
SIAM Journal on Computing
Mathematics
Computer Science
On the Number of Connected Sets in Bounded Degree Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Fine-Grained Complexity of Graph Homomorphism Problem for Bounded-Treewidth Graphs
