Author of the publication

Efficient Approximation Algorithms for Domatic Partition and On-Line Coloring of Circular Arc Graphs.

, , and . ICCI, page 26-30. IEEE Computer Society, (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Hierarchically Specified Unit Disk Graphs., , , and . Theor. Comput. Sci., 174 (1-2): 23-65 (1997)The Covering Problem for Linear Context-Free Grammars., , and . Theor. Comput. Sci., 2 (3): 361-382 (1976)Complexity Metatheorems for Context-Free Grammar Problems., and . J. Comput. Syst. Sci., 13 (3): 318-334 (1976)The Complexity of Planar Counting Problems, , , and . CoRR, (1998)Predecessor and Permutation Existence Problems for Sequential Dynamical Systems., , , , , and . DMCS, volume AB of DMTCS Proceedings, page 69-80. DMTCS, (2003)Power Indices and Easier Hard Problems., and . Math. Syst. Theory, 23 (4): 209-225 (1990)I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract)., , , , and . PODC, page 122. ACM, (1996)Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report)., and . STACS, volume 210 of Lecture Notes in Computer Science, page 277-290. Springer, (1986)The Complexity of Approximation PSPACE-Complete Problems for Hierarchical Specifications., , and . Nord. J. Comput., 1 (3): 275-316 (1994)Efficient Approximation Algorithms for Domatic Partition and On-Line Coloring of Circular Arc Graphs., , and . ICCI, page 26-30. IEEE Computer Society, (1993)