default search action
Christophe Weibel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j7]Erin W. Chambers
, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, S. Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides:
Connectivity Graphs of Uncertainty Regions. Algorithmica 78(3): 990-1019 (2017) - 2013
- [j6]Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel:
Flow-cut gaps for integer and fractional multiflows. J. Comb. Theory B 103(2): 248-273 (2013) - 2012
- [j5]Christophe Weibel:
Maximal f-Vectors of Minkowski Sums of Large Numbers of Polytopes. Discret. Comput. Geom. 47(3): 519-537 (2012) - [c10]Amit Chakrabarti
When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks. STOC 2012: 19-26 - [i5]Amit Chakrabarti, Lisa Fleischer, Christophe Weibel:
When the Cut Condition is Enough: A Complete Characterization for Multiflow Problems in Series-Parallel Networks. CoRR abs/1203.4041 (2012) - 2011
- [c9]Christophe Weibel, Linqiao Zhang:
Minimum perimeter convex hull of imprecise points in convex regions. SCG 2011: 293-294 - 2010
- [j4]Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang:
A Succinct 3D Visibility Skeleton. Discret. Math. Algorithms Appl. 2(4): 567-590 (2010) - [j3]Komei Fukuda, Christophe Weibel:
A linear equation for Minkowski sums of polytopes relatively in general position. Eur. J. Comb. 31(2): 565-573 (2010) - [c8]Christophe Weibel:
Implementation and Parallelization of a Reverse-Search Algorithm for Minkowski Sums. ALENEX 2010: 34-42 - [c7]Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang:
On the Computation of 3D Visibility Skeletons. COCOON 2010: 469-478 - [c6]Vida Dujmovic, William S. Evans, Stephen G. Kobourov
On Graphs Supported by Line Sets. GD 2010: 177-182 - [c5]Erin W. Chambers
Connectivity Graphs of Uncertainty Regions. ISAAC (2) 2010: 434-445 - [c4]Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel:
Flow-Cut Gaps for Integer and Fractional Multiflows. SODA 2010: 1198-1208 - [i4]Christophe Weibel:
Maximal f-vectors of Minkowski sums of large numbers of polytopes. CoRR abs/1002.0155 (2010) - [i3]Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel:
Flow-Cut Gaps for Integer and Fractional Multiflows. CoRR abs/1008.2136 (2010) - [i2]Guyslain Naves
Congestion in planar graphs with demands on faces. CoRR abs/1008.3653 (2010) - [i1]Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Srinivasan Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides:
Connectivity graphs of uncertainty regions. CoRR abs/1009.3469 (2010)
2000 – 2009
- 2009
- [j2]Efi Fogel
On the Exact Maximum Complexity of Minkowski Sums of Polytopes. Discret. Comput. Geom. 42(4): 654-669 (2009) - 2008
- [c3]Linqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides:
On the Size of the 3D Visibility Skeleton: Experimental Results. ESA 2008: 805-816 - 2007
- [j1]Komei Fukuda, Christophe Weibel:
f-Vectors of Minkowski Additions of Convex Polytopes. Discret. Comput. Geom. 37(4): 503-516 (2007) - [c2]Efi Fogel
On the exact maximum complexity of Minkowski sums of convex polyhedra. SCG 2007: 319-326 - 2005
- [c1]Christophe Weibel, Komei Fukuda:
Computing faces up to k dimensions of a Minkowski Sum of Polytopes. CCCG 2005: 256-259
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: