PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Birmelé, Etienne"

Author of the publication

copydeleteadd this publication to your clipboard
The Erdös-Pósa Property For Long Circuits.

, , and . Combinatorica, 27 (2): 135-145 (2007)

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.

No persons found for author name Birmelé, Etienne
add a person with the name Birmelé, Etienne
 

Other publications of authors with the same name

Bayesian Methods for Graph Clustering., , and . GfKl, page 229-239. Springer, (2008)Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets., , , , , , , , , and 1 other author(s). Theor. Comput. Sci., (2012)On the Minimum Eccentricity Isometric Cycle Problem., , and . Electr. Notes Theor. Comput. Sci., (2019)The Erdös-Pósa Property For Long Circuits., , and . Combinatorica, 27 (2): 135-145 (2007)Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem., , and . COCOA, volume 10043 of Lecture Notes in Computer Science, page 216-229. Springer, (2016)Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms., , , , , , , and . WABI, volume 6293 of Lecture Notes in Computer Science, page 226-237. Springer, (2010)Optimal Listing of Cycles and st-Paths in Undirected Graphs, , , , , , , and . CoRR, (2012)Decomposing a Graph into Shortest Paths with Bounded Eccentricity., , , and . ISAAC, volume 92 of LIPIcs, page 15:1-15:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree., , and . Journal of Graph Theory, 53 (4): 315-332 (2006)Every longest circuit of a 3-connected, K3, 3-minor free graph has a chord.. Journal of Graph Theory, 58 (4): 293-298 (2008)