The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Daniel Bienstock: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daniel Bienstock
    Some Provably Hard Crossing Number Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:253-260 [Conf]
  2. Daniel Bienstock
    Some Provably Hard Crossing Number Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:61-83 [Conf]
  3. Daniel Bienstock
    A Lot-Sizing Problem on Trees, Related to Network Design. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:421-434 [Conf]
  4. Daniel Bienstock
    Computational Study of a Family of Mixed-Integer Quadratic Programming Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:80-94 [Conf]
  5. Daniel Bienstock
    epsilon-Approximate linear programs: new bounds and computation. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:1-2 [Conf]
  6. Daniel Bienstock, Garud Iyengar
    Solving fractional packing problems in Oast(1/?) iterations. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:146-155 [Conf]
  7. Daniel Bienstock, Clyde L. Monma
    On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1990, v:5, n:1, pp:93-109 [Journal]
  8. Daniel Bienstock
    Some Provably Hard Crossing Number Problems. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:443-459 [Journal]
  9. Daniel Bienstock, Paul D. Seymour
    Monotonicity in Graph Searching. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:2, pp:239-245 [Journal]
  10. Daniel Bienstock
    On embedding graphs in trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:49, n:1, pp:103-136 [Journal]
  11. Daniel Bienstock, Nathaniel Dean
    On obstructions to small face covers in planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:55, n:2, pp:163-189 [Journal]
  12. Daniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas
    Quickly excluding a forest. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:2, pp:274-283 [Journal]
  13. Daniel Bienstock
    Computational study of a family of mixed-integer quadratic programming problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:74, n:, pp:121-140 [Journal]
  14. Daniel Bienstock, Sunil Chopra, Oktay Günlük, Chih-yang Tsai
    Minimum cost capacity installation for multicommodity network flows. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:81, n:, pp:177-199 [Journal]
  15. Daniel Bienstock, Oktay Günlük
    Computational experience with a difficult mixed-integer multicommodity flow problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:68, n:, pp:213-237 [Journal]
  16. Daniel Bienstock, Michel X. Goemans, David Simchi-Levi, David P. Williamson
    A note on the prize collecting traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:59, n:, pp:413-420 [Journal]
  17. Daniel Bienstock, Mark Zuckerberg
    Approximate fixed-rank closures of covering problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:1, pp:9-27 [Journal]
  18. Daniel Bienstock
    Linear-Time Test for Small Face Covers in Any Fixed Surface. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:5, pp:907-911 [Journal]
  19. Daniel Bienstock, Nicole Diaz
    Blocking Small Cuts in a Network, and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:3, pp:482-499 [Journal]
  20. Daniel Bienstock, Garud Iyengar
    Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:4, pp:825-854 [Journal]
  21. Daniel Bienstock, Clyde L. Monma
    On the Complexity of Covering Vertices by Faces in a Planar Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:1, pp:53-76 [Journal]
  22. Daniel Bienstock
    Asymptotic Analysis of some Network Reliability Models. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:1, pp:14-21 [Journal]
  23. Daniel Bienstock, Ernest F. Brickell, Clyde L. Monma
    On the Structure of Minimum-Weight k-Connected Spanning Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:3, pp:320-329 [Journal]
  24. Daniel Bienstock, Ervin Györi
    An Extremal Problem on Sparse 0-1 Matrices. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:1, pp:17-27 [Journal]
  25. Daniel Bienstock, Iraj Saniee
    ATM Network Design: Traffic Models and Optimization-Based Heuristics. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 2001, v:16, n:3-4, pp:399-421 [Journal]
  26. Daniel Bienstock
    On the complexity of testing for odd holes and induced odd paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:90, n:1, pp:85-92 [Journal]

  27. Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems. [Citation Graph (, )][DBLP]


  28. Solving LP Relaxations of Large-Scale Precedence Constrained Problems. [Citation Graph (, )][DBLP]


  29. Broadcasting with random faults. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002