Sven de Vries

According to our database1, Sven de Vries authored at least 23 papers between 1998 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Matroidal Approximations of Independence Systems.
CoRR, 2019

2017
Computing cyclic invariants for molecular graphs.
Networks, 2017

2015
Faster separation of 1-wheel inequalities by graph products.
Discrete Applied Mathematics, 2015

Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling.
Computational Statistics & Data Analysis, 2015

2013
Graph products for faster separation of 1-wheel inequalities.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2011
An Ascending Vickrey Auction for Selling Bases of a Matroid.
Operations Research, 2011

2010
A Generalized Wedelin Heuristic for Integer Programming.
INFORMS Journal on Computing, 2010

2009
Minimum Cycle Bases and Their Applications.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2008
On the reconstruction of binary and permutation matrices under (binary) tomographic constraints.
Theor. Comput. Sci., 2008

Ascending auctions for integral (poly)matroids with concave nondecreasing separable values.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
Polyhedral Properties of the K -median Problem on a Tree.
Math. Program., 2007

On ascending Vickrey auctions for heterogeneous objects.
J. Economic Theory, 2007

2005
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions.
Management Science, 2005

Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation.
J. Comb. Optim., 2005

2004
Separating multi-oddity constrained shortest circuits over the polytope of stable multisets.
Oper. Res. Lett., 2004

Minimum Cycle Bases for Network Graphs.
Algorithmica, 2004

2003
Combinatorial Auctions: A Survey.
INFORMS Journal on Computing, 2003

2002
On the algorithmic inversion of the discrete Radon transform.
Theor. Comput. Sci., 2002

On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes.
SIAM J. Discrete Math., 2002

Antiweb-wheel inequalities and their separation problems over the stable set polytopes.
Math. Program., 2002

Separation of Antiweb-Wheel Inequalities Over Stable Set Polytopes.
Electronic Notes in Discrete Mathematics, 2002

2000
Approximating Binary Images from Discrete X-Rays.
SIAM Journal on Optimization, 2000

1998
Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography.
Int. J. Imaging Systems and Technology, 1998


  Loading...