The SCEAS System
Navigation Menu

Search the dblp DataBase


David Hartvigsen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Hartvigsen
    Generalized Max Flows and Augmenting Paths. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:185-197 [Conf]
  2. David Hartvigsen
    A Submodular Optimization Problem with Side Constraints. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:249-259 [Conf]
  3. David Hartvigsen
    The Square-Free 2-Factor Problem in Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:234-241 [Conf]
  4. David Hartvigsen
    A strongly polynomial time algorithm for a constrained submodular optimization problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:183-194 [Journal]
  5. David Hartvigsen
    Characterizing the Flow Equivalent Trees of a Network. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:128, n:2-3, pp:387-394 [Journal]
  6. David Hartvigsen
    The Planar Multiterminal Cut Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:85, n:3, pp:203-222 [Journal]
  7. David Hartvigsen, Eitan Zemel
    The Complexity of Lifted Inequalities for the Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:39, n:2, pp:113-123 [Journal]
  8. David Hartvigsen
    Minimum Path Bases. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:15, n:1, pp:125-142 [Journal]
  9. Gérard Cornuéjols, David Hartvigsen
    An extension of matching theory. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:40, n:3, pp:285-296 [Journal]
  10. David Hartvigsen, Russell Mardon
    When Do Short Cycles Generate the Cycle Space? [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:57, n:1, pp:88-99 [Journal]
  11. David Hartvigsen
    Finding maximum square-free 2-matchings in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:5, pp:693-705 [Journal]
  12. Robert F. Easley, David Hartvigsen
    Crossing properties of multiterminal cuts. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:3, pp:215-220 [Journal]
  13. David Hartvigsen
    Book review. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:4, pp:391-392 [Journal]
  14. David Hartvigsen
    Compact Representations of Cuts. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:1, pp:49-66 [Journal]
  15. David Hartvigsen, Russell Mardon
    The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:3, pp:403-418 [Journal]
  16. David Hartvigsen, Pavol Hell, Jácint Szabó
    The k-piece packing problem. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:4, pp:267-293 [Journal]
  17. David Hartvigsen
    Representing the strengths and directions of pairwise comparisons. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:163, n:2, pp:357-369 [Journal]
  18. David Hartvigsen, Yanjun Li
    Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:43-52 [Conf]
  19. David Hartvigsen, Russell Mardon
    Cycle bases from orderings and coverings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:94, n:2, pp:81-94 [Journal]
  20. David Hartvigsen
    Generalizing the all-pairs min cut problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:151-169 [Journal]

  21. Maximum Cardinality 1-Restricted Simple 2-Matchings. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002