( en | de | ru )

 

Disambiguation of "Joeris, Benson L."

Author of the publication

copydeleteadd this publication to your clipboard
An implicit representation of chordal comparability graphs in linear time.

, , , , and . 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. You can also use the button next to the name to display some publications already assigned to the person.

Klaus Joeris

Günter Benson

Dagmar Joeris

Bernhard Joeris

Kurt Joeris

 

Other publications of authors with the same name

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