default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSven de Vries
Person information
- affiliation: University of Trier, Department of Mathematics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j25]Marianna De Santis, Sven de Vries, Martin Schmidt, Lukas Winkel:
A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems. INFORMS J. Comput. 34(6): 3117-3133 (2022)- [j24]Sven de Vries, Bernd Perscheid
:
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints. J. Glob. Optim. 84(3): 591-606 (2022) - 2021
- [j23]Sven de Vries, Bernd Perscheid:
A smaller extended formulation for the odd cycle inequalities of the stable set polytope. Discret. Appl. Math. 303: 14-21 (2021) - 2020
- [j22]Sven de Vries, Ulf Friedrich, Stephen Raach:
Geometry of gross substitutes valuations. Discret. Appl. Math. 272: 16-23 (2020) - [j21]Sven de Vries, Ulf Friedrich, Bernd Perscheid:
An extended formulation for the 1-wheel inequalities of the stable set polytope. Networks 75(1): 86-94 (2020) - [j20]Sven de Vries, Rakesh V. Vohra:
Matroidal approximations of independence systems. Oper. Res. Lett. 48(5): 587-593 (2020)
2010 – 2019
- 2019
- [i2]Sven de Vries, Rakesh V. Vohra:
Matroidal Approximations of Independence Systems. CoRR abs/1906.06217 (2019) - 2017
- [j19]Franziska Berger, Peter Gritzmann, Sven de Vries:
Computing cyclic invariants for molecular graphs. Networks 70(2): 116-131 (2017) - 2015
- [j18]Ulf Friedrich, Ralf T. Münnich, Sven de Vries, Matthias Wagner:
Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling. Comput. Stat. Data Anal. 92: 1-12 (2015) - [j17]Sven de Vries:
Faster separation of 1-wheel inequalities by graph products. Discret. Appl. Math. 195: 74-83 (2015) - 2013
- [i1]Sven de Vries:
Graph products for faster separation of 1-wheel inequalities. CTW 2013: 219-222 - 2011
- [j16]Sushil Bikhchandani, Sven de Vries, James Schummer, Rakesh V. Vohra:
An Ascending Vickrey Auction for Selling Bases of a Matroid. Oper. Res. 59(2): 400-413 (2011) - 2010
- [j15]Oliver Bastert, Benjamin Hummel, Sven de Vries:
A Generalized Wedelin Heuristic for Integer Programming. INFORMS J. Comput. 22(1): 93-107 (2010)
2000 – 2009
- 2009
- [c2]Franziska Berger, Peter Gritzmann, Sven de Vries:
Minimum Cycle Bases and Their Applications. Algorithmics of Large and Complex Networks 2009: 34-49 - 2008
- [j14]Sara Brunetti, Alberto Del Lungo, Peter Gritzmann, Sven de Vries:
On the reconstruction of binary and permutation matrices under (binary) tomographic constraints. Theor. Comput. Sci. 406(1-2): 63-71 (2008) - [c1]Sushil Bikhchandani, Sven de Vries, James Schummer, Rakesh V. Vohra:
Ascending auctions for integral (poly)matroids with concave nondecreasing separable values. SODA 2008: 864-873 - 2007
- [j13]Sven de Vries, James Schummer, Rakesh V. Vohra:
On ascending Vickrey auctions for heterogeneous objects. J. Econ. Theory 132(1): 95-118 (2007) - [j12]Sven de Vries, Marc E. Posner, Rakesh V. Vohra:
Polyhedral Properties of the K -median Problem on a Tree. Math. Program. 110(2): 261-285 (2007) - 2005
- [j11]Jon Lee, Janny Leung, Sven de Vries:
Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation. J. Comb. Optim. 9(1): 59-67 (2005) - [j10]Oktay Günlük, Laszlo Ladányi, Sven de Vries:
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions. Manag. Sci. 51(3): 391-406 (2005) - 2004
- [j9]Franziska Berger, Peter Gritzmann, Sven de Vries:
Minimum Cycle Bases for Network Graphs. Algorithmica 40(1): 51-62 (2004) - [j8]Eddie Cheng, Sven de Vries:
Separating multi-oddity constrained shortest circuits over the polytope of stable multisets. Oper. Res. Lett. 32(2): 181-184 (2004) - 2003
- [j7]Sven de Vries, Rakesh V. Vohra:
Combinatorial Auctions: A Survey. INFORMS J. Comput. 15(3): 284-309 (2003) - 2002
- [j6]Eddie Cheng, Sven de Vries:
Separation of Antiweb-Wheel Inequalities Over Stable Set Polytopes. Electron. Notes Discret. Math. 11: 157-171 (2002) - [j5]Eddie Cheng, Sven de Vries:
Antiweb-wheel inequalities and their separation problems over the stable set polytopes. Math. Program. 92(1): 153-175 (2002) - [j4]Eddie Cheng, Sven de Vries:
On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes. SIAM J. Discret. Math. 15(4): 470-487 (2002) - [j3]Peter Gritzmann, Sven de Vries:
On the algorithmic inversion of the discrete Radon transform. Theor. Comput. Sci. 281(1-2): 455-469 (2002) - 2000
- [j2]Peter Gritzmann, Sven de Vries, Markus Wiegelmann:
Approximating Binary Images from Discrete X-Rays. SIAM J. Optim. 11(2): 522-546 (2000)
1990 – 1999
- 1998
- [j1]Peter Gritzmann, Dieter Prangenberg, Sven de Vries, Markus Wiegelmann:
Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography. Int. J. Imaging Syst. Technol. 9(2-3): 101-109 (1998)
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-06-14 18:08 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:
