( en | de | ru )

 

Disambiguation of "Kára, Jan"

Author of the publication

copydeleteadd this publication to your clipboard
On the Complexity of the Balanced Vertex Ordering Problem.

, , and . COCOON, volume 3595 of Lecture Notes in Computer Science, page 849-858. Springer, (2005)

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.

Maher Kara

Michael Kara

Kara Borries

Mehmet Kara

Esma Kara

 

Other publications of authors with the same name

Minimum Degree and the Number of Chords., and . Ars Comb., (2003)On the Complexity of the Balanced Vertex Ordering Problem., , and . COCOON, volume 3595 of Lecture Notes in Computer Science, page 849-858. Springer, (2005)Clustered Planarity: Small Clusters in Eulerian Graphs., , , , , and . GD, volume 4875 of Lecture Notes in Computer Science, page 303-314. Springer, (2007)Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs., and . IWPEC, volume 4169 of Lecture Notes in Computer Science, page 166-174. Springer, (2006)On the Complexity of the Balanced Vertex Ordering Problem., , and . Discret. Math. Theor. Comput. Sci., (2007)Free Binary Decision Diagrams for Computation of EARn, and . Electron. Colloquium Comput. Complex., (2003)Complexity of Pattern Coloring of Cycle Systems., , , and . WG, volume 2573 of Lecture Notes in Computer Science, page 164-175. Springer, (2002)Noncrossing Hamiltonian Paths in Geometric Graphs., , , and . GD, volume 2912 of Lecture Notes in Computer Science, page 86-97. Springer, (2003)On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane., , and . Discret. Comput. Geom., 34 (3): 497-506 (2005)Noncrossing Hamiltonian paths in geometric graphs., , , and . Discret. Appl. Math., 155 (9): 1096-1105 (2007)