Michael J. Pelsmajer

Discret. Math., 2021

Strong Hanani-Tutte for the Torus.

[BibT_eX]

[DOI]

Radoslav Fulek

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

A Simple Characterization of Proportionally 2-choosable Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2020

2019

Proportional choosability: A new list analogue of equitable coloring.

[BibT_eX]

[DOI]

Discret. Math., 2019

2018

Total Equitable List Coloring.

[BibT_eX]

[DOI]

Hemanshu Kaul

Jeffrey A. Mudrock

Graphs Comb., 2018

2016

Hanani-Tutte for Radial Planarity II.

[BibT_eX]

[DOI]

Radoslav Fulek

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2015

Finding Minors in Graphs with a Given Path Structure.

[BibT_eX]

[DOI]

André Kündgen

Radhika Ramamurthi

J. Graph Theory, 2015

Hanani-Tutte for Radial Planarity.

[BibT_eX]

[DOI]

Radoslav Fulek

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014

Statistical models for cores decomposition of an undirected random graph.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Maximum Induced Forests in Graphs of Bounded Treewidth.

[BibT_eX]

[DOI]

Glenn G. Chappell

Electron. J. Comb., 2013

2011

Dominating sets in triangulations on surfaces.

[BibT_eX]

[DOI]

Hong Liu

Ars Math. Contemp., 2011

Crossing Numbers of Graphs with Rotation Systems.

[BibT_eX]

[DOI]

Algorithmica, 2011

Hanani-Tutte and Monotone Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Adjacent Crossings Do Matter.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010

Dominating sets in plane triangulations.

[BibT_eX]

[DOI]

Erika L. C. King

Discret. Math., 2010

2009

Strong Hanani--Tutte on the Projective Plane.

[BibT_eX]

[DOI]

Despina Stasi

SIAM J. Discret. Math., 2009

Equitable list coloring and treewidth.

[BibT_eX]

[DOI]

J. Graph Theory, 2009

Removing Independently Even Crossings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 17th International Symposium, 2009

2008

Nonrepetitive colorings of graphs of bounded tree-width.

[BibT_eX]

[DOI]

André Kündgen

Discret. Math., 2008

Odd Crossing Number and Crossing Number Are Not the Same.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2008

Axiomization of the center function on trees.

[BibT_eX]

[DOI]

Henry Martyn Mulder

K. Brooks Reid

Australas. J Comb., 2008

On the Induced Matching Problem.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science, 2008

2007

Removing even crossings.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Removing Even Crossings on Surfaces.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Train Tracks and Confluent Drawings.

[BibT_eX]

[DOI]

Algorithmica, 2007

Crossing Numbers and Parameterized Complexity.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 15th International Symposium, 2007

Crossing Number of Graphs with Rotation Systems.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 15th International Symposium, 2007

2006

Transversal numbers of translates of a convex body.

[BibT_eX]

[DOI]

Discret. Math., 2006

Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance.

[BibT_eX]

[DOI]

Gruia Calinescu

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

2005

Graph Minors and Reliable Single Message Transmission.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

Odd Crossing Number Is Not Crossing Number.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 13th International Symposium, 2005

Integer Programming Methods for Several Optimization Problems in Graph Theory.

[BibT_eX]

Proceedings of the 20th International Conference on Computers and Their Applications, 2005

2004

Equitable list-coloring for graphs of maximum degree 3.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

Maximum Induced Linear Forests in Outerplanar Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2004

The Toughness of a Toroidal Graph with Connectivity 3 and Girth 6 is Exactly 1.

[BibT_eX]

[DOI]

Weiting Cao

Graphs Comb., 2004

Parameterized Algorithms for Feedback Vertex Set.

[BibT_eX]

[DOI]

Iyad A. Kanj

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

k-Robust Single-Message Transmission.

[BibT_eX]

[DOI]

André Kündgen

Radhika Ramamurthi

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003

A list analogue of equitable coloring.

[BibT_eX]

[DOI]

Alexandr V. Kostochka