( en | de | ru )

 

Disambiguation of "Weibel, Christophe"

Author of the publication

copydeleteadd this publication to your clipboard
Connectivity Graphs of Uncertainty Regions

, , , , , , , , , and . Algorithmica, 78 (3): 990--1019 (2017)
DOI: 10.1007/s00453-016-0191-2

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.

Bernd Weibel

Andrea Weibel

Kurt Weibel

Benedikt Weibel

Samuel Weibel

 

Other publications of authors with the same name

Connectivity Graphs of Uncertainty Regions, , , , , , , , , and . Algorithmica, 78 (3): 990--1019 (2017)A linear equation for Minkowski sums of polytopes relatively in general position., and . Eur. J. Comb., 31 (2): 565-573 (2010)Computing faces up to k dimensions of a Minkowski Sum of Polytopes., and . CCCG, page 256-259. (2005)Flow-Cut Gaps for Integer and Fractional Multiflows., , and . SODA, page 1198-1208. SIAM, (2010)Connectivity Graphs of Uncertainty Regions., , , , , , , , , and . ISAAC (2), volume 6507 of Lecture Notes in Computer Science, page 434-445. Springer, (2010)Implementation and Parallelization of a Reverse-Search Algorithm for Minkowski Sums.. ALENEX, page 34-42. SIAM, (2010)f-Vectors of Minkowski Additions of Convex Polytopes., and . Discret. Comput. Geom., 37 (4): 503-516 (2007)On Graphs Supported by Line Sets., , , , , and . GD, volume 6502 of Lecture Notes in Computer Science, page 177-182. Springer, (2010)When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks., , and . STOC, page 19-26. ACM, (2012)On the exact maximum complexity of Minkowski sums of convex polyhedra., , and . SCG, page 319-326. ACM, (2007)