( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An implicit representation of chordal comparability graphs in linear time.

, , , , и . Discret. Appl. Math., 158 (8): 869-875 (2010)

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.

Klaus Joeris

Günter Benson

Bernhard Joeris

Dagmar Joeris

Kurt Joeris

 

Другие публикации лиц с тем же именем

O(m logn) Split Decomposition of Strongly Connected Graphs., , и . Graph Theory, Computational Intelligence and Thought, том 5420 из Lecture Notes in Computer Science, стр. 158-171. Springer, (2009)Linear-Time Recognition of Helly Circular-Arc Models and Graphs., , , , и . Algorithmica, 59 (2): 215-239 (2011)Simple DFS on the complement of a graph and on partially complemented digraphs., , , и . Inf. Process. Lett., (2017)O(mlogn) split decomposition of strongly-connected graphs., , и . Discret. Appl. Math., 158 (7): 779-799 (2010)An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time., , , , и . WG, том 4271 из Lecture Notes in Computer Science, стр. 168-178. Springer, (2006)Geometric Spanning Cycles in Bichromatic Point Sets., , и . Graphs Comb., 31 (2): 453-465 (2015)Simple DFS on the Complement of a Graph and on Partially Complemented Digraphs., , , и . CoRR, (2013)Monitoring the Plane with Rotating Radars., , , , , , , , , и . Graphs Comb., 31 (2): 393-405 (2015)An implicit representation of chordal comparability graphs in linear time., , , , и . Discret. Appl. Math., 158 (8): 869-875 (2010)