Michel X. Goemans

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Jan Vondrák

> Home > Persons > Michel X. Goemans

Publications

2008
[j43]
- view
  authority control:
- export record
  dblp key:
  - journals/mor/DeanGV08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mor/DeanGV08
Brian C. Dean, Michel X. Goemans, Jan Vondrák:
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. Math. Oper. Res. 33(4): 945-964 (2008)
2006
[j39]
- view
  authority control:
- export record
  dblp key:
  - journals/rsa/GoemansV06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/GoemansV06
Michel X. Goemans, Jan Vondrák:
Covering minimum spanning trees of random subgraphs. Random Struct. Algorithms 29(3): 257-276 (2006)
[c35]
- view
  authority control:
- export record
  dblp key:
  - conf/latin/GoemansV06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/GoemansV06
Michel X. Goemans, Jan Vondrák:
Stochastic Covering and Adaptivity. LATIN 2006: 532-543
2005
[c32]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/soda/DeanGV05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/DeanGV05
Brian C. Dean, Michel X. Goemans, Jan Vondrák:
Adaptivity and approximation for stochastic packing problems. SODA 2005: 395-404
2004
[c29]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/DeanGV04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/DeanGV04
Brian C. Dean, Michel X. Goemans, Jan Vondrák:
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. FOCS 2004: 208-217
[c25]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/soda/GoemansV04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/GoemansV04
Michel X. Goemans, Jan Vondrák:
Covering minimum spanning trees of random subgraphs. SODA 2004: 934-941
2003
[j34]
- view
  authority control:
- export record
  dblp key:
  - journals/aam/ChowFGV03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aam/ChowFGV03
Timothy Y. Chow, C. Kenneth Fan, Michel X. Goemans, Jan Vondrák:
Wide partitions, Latin tableaux, and Rota's basis conjecture. Adv. Appl. Math. 31(2): 334-358 (2003)

a service of

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.