Generalized map coloring for use in geographical information systems
Proceedings of the 8th ACM international symposium on Advances in geographic information systems
Computer assisted proof of optimal approximability results
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On local transformation of polygons with visibility properties
Theoretical Computer Science
Coloring face-hypergraphs of graphs on surfaces
Journal of Combinatorial Theory Series B
Coloring the faces of convex polyhedra so that like colors are far apart
Journal of Combinatorial Theory Series B
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Bounded-Degree Independent Sets in Planar Graphs
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
The 5 Colour Theorem in Isabelle/Isar
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 Is 3-Colorable
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
Computational Geometry: Theory and Applications
Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
Combinatorics, Probability and Computing
Excluding Minors in Nonplanar Graphs of Girth at Least Five
Combinatorics, Probability and Computing
Edge-disjoint odd cycles in planar graphs
Journal of Combinatorial Theory Series B
Chromatic Roots are Dense in the Whole Complex Plane
Combinatorics, Probability and Computing
Extending precolorings of subgraphs of locally planar graphs
European Journal of Combinatorics - Special issue: Topological graph theory
Rotation sequences and edge-colouring of binary tree pairs
Theoretical Computer Science
Journal of Combinatorial Theory Series B
On the structure of k-connected graphs without Kk-minor
European Journal of Combinatorics - Special issue: Topological graph theory II
Cyclic, diagonal and facial colorings
European Journal of Combinatorics - Special issue: Topological graph theory II
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Simultaneous diagonal flips in plane triangulations
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Random triangulations of planar point sets
Proceedings of the twenty-second annual symposium on Computational geometry
Homomorphism bounded classes of graphs
European Journal of Combinatorics
Theoretical Computer Science - Computing and combinatorics
On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture
Journal of Combinatorial Theory Series B
Contractions, cycle double covers, and cyclic colorings in locally connected graphs
Journal of Combinatorial Theory Series B
Distance constraints in graph color extensions
Journal of Combinatorial Theory Series B
A relaxed Hadwiger's Conjecture for list colorings
Journal of Combinatorial Theory Series B
Terminal backup, 3D matching, and covering cubic graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Half integral packing, Erdős-Posá-property and graph minors
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Spanning cycles in regular matroids without M*(K5) minors
European Journal of Combinatorics
Fractional coloring and the odd Hadwiger's conjecture
European Journal of Combinatorics
Journal of Combinatorial Theory Series B
Locally planar graphs are 5-choosable
Journal of Combinatorial Theory Series B
The Maximum Independent Set Problem in Planar Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Linear connectivity forces large complete bipartite minors
Journal of Combinatorial Theory Series B
ACM SIGACT News
List-color-critical graphs on a fixed surface
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Additive approximation algorithms for list-coloring minor-closed class of graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Three-coloring triangle-free planar graphs in linear time
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
List-coloring graphs without K4,k-minors
Discrete Applied Mathematics
A weakening of the odd hadwiger's conjecture
Combinatorics, Probability and Computing
Linear connectivity forces large complete bipartite minors
Journal of Combinatorial Theory Series B
Hadwiger's conjecture is decidable
Proceedings of the forty-first annual ACM symposium on Theory of computing
Note: Note on coloring graphs without odd-Kk-minors
Journal of Combinatorial Theory Series B
Geometric attraction-driven flow for image segmentation and boundary detection
Journal of Visual Communication and Image Representation
Facial colorings using Hall's Theorem
European Journal of Combinatorics
Four colouring the vertices of the triangulation of a polygon containing a hole
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
The reduced genus of a multigraph
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Note: A simple algorithm for 4-coloring 3-colorable planar graphs
Theoretical Computer Science
A bound on the treewidth of planar even-hole-free graphs
Discrete Applied Mathematics
The complexity of changing colourings with bounded maximum degree
Information Processing Letters
Contractibility and the Hadwiger Conjecture
European Journal of Combinatorics
Decomposition, approximation, and coloring of odd-minor-free graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
One more probabilistic reformulation of the four colour conjecture
Combinatorics, Probability and Computing
MMACTEE'09 Proceedings of the 11th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
Identity Crisis: Simulations and Models
Simulation and Gaming
On degrees in random triangulations of point sets
Journal of Combinatorial Theory Series A
Three-coloring triangle-free planar graphs in linear time
ACM Transactions on Algorithms (TALG)
Hybrid logics and NP graph properties
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Clique minors in claw-free graphs
Journal of Combinatorial Theory Series B
Thomassen's Choosability Argument Revisited
SIAM Journal on Discrete Mathematics
Terminal Backup, 3D Matching, and Covering Cubic Graphs
SIAM Journal on Computing
Cell segmentation using coupled level sets and graph-vertex coloring
MICCAI'06 Proceedings of the 9th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part I
Robust tracking of migrating cells using four-color level set segmentation
ACIVS'06 Proceedings of the 8th international conference on Advanced Concepts For Intelligent Vision Systems
List-coloring graphs without subdivisions and without immersions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Cyclic colorings of plane graphs with independent faces
European Journal of Combinatorics
Approximate min-max relations for odd cycles in planar graphs
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Frequency assignment and multicoloring powers of square and triangular meshes
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
A general framework for coloring problems: old results, new results, and open problems
IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory
On dynamic coloring for planar graphs and graphs of higher genus
Discrete Applied Mathematics
Strong orientations of planar graphs with bounded stretch factor
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
From the plane to higher surfaces
Journal of Combinatorial Theory Series B
Survey: Randomly colouring graphs (a combinatorial view)
Computer Science Review
Five-coloring graphs on the Klein bottle
Journal of Combinatorial Theory Series B
Formalizing frankl's conjecture: FC-families
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Strongly connected orientations of plane graphs
Discrete Applied Mathematics
Functional unit maps for data-driven visualization of high-density EEG coherence
EUROVIS'07 Proceedings of the 9th Joint Eurographics / IEEE VGTC conference on Visualization
Nonblocker in h-minor free graphs: kernelization meets discharging
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Automated generation of conjectures on forbidden subgraph characterization
Discrete Applied Mathematics
| Hi-index | 0.00 |