- Spanning spiders and lightsplitting switches # Luisa Gargano 1 , Mikael Hammar 1 , Pavol Hell 2
- Adaptable Colouring of Graph Products Tsai-Lien Wong
- Annals of Operations Research 138, 179187, 2005 c 2005 Springer Science + Business Media, Inc. Manufactured in The Netherlands.
- Duality for Min-Max Orderings Dichotomy for Min Cost Homomorphisms
- List Matrix Partitions of Chordal Graphs Tomas Feder
- A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
- Antidirected Hamiltonian Paths Between Speci ed Vertices of a Tournament
- 1 Introduction 1 1.1 Graphs, digraphs, and homomorphisms 1
- Matrix Partitions of Perfect Graphs Tomas Feder
- Complexity of Graph Partition Problems Tomas Feder \Lambda Pavol Hell y Sulamita Klein z Rajeev Motwani x
- Bi-Arc Graphs and the Complexity of List Homomorphisms
- Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and
- File: DISTL2 181201 . By:CV Date:12:03:98 . Time:11:36 LOP8M. V8.B. Page 01:01 Codes: 3893 Signs: 2255 Length: 50 pic 3 pts, 212 mm
- The k-Piece Packing Problem David Hartvigsen, University of Notre Dame,
- Adjusted Interval Digraphs Tomas Feder Pavol Hell Jing Huang Arash Rafiey
- INTRODUCTION In this introductory chapter we shall describe some basic views of homomor-
- Colouring, Constraint Satisfaction, and Complexity For Ales Pultr on the Occasion of his 70th Birthday
- Counting List Homomorphisms for Graphs with Bounded Degrees
- List Homomorphisms and Circular Arc Graphs Tomas Feder \Lambda , Pavol Hell y , and Jing Huang z
- LIST OF PUBLICATIONS October 27, 2003
- Interval Bigraphs and Circular Arc Graphs Pavol Hell and Jing Huang y
- Algorithmic aspects of graph homomorphisms Homomorphisms are a useful model for a wide variety of combinatorial prob
- A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
- The circular chromatic number of seriesparallel graphs
- List Partitions of Chordal Graphs Tomas Feder
- List Partitions Tomas Feder \Lambda Pavol Hell y Sulamita Klein z
- Graph Packings School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada
- Acyclic homomorphisms and circular colorings of Tomas Feder
- Full Constraint Satisfaction Problems Tomas Feder
- Chordal Obstructions to MPartitions Tomas Feder
- Partitioning Chordal Graphs into Independent Sets and Cliques
- We thank all readers for sending us their corrections. In particular, we gratefully acknowledge contributions from Dennis Epple,
- List Homomorphisms of Graphs with Bounded Degrees Tomas Feder # , Pavol Hell + , and Jing Huang #
- List Partitions and Trigraph Homomorphisms Tomas Feder
