The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

András Sebö: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Karina Marcus, András Sebö
    On Integer Multiflows and Metric Packings in Matroids. [Citation Graph (0, 0)][DBLP]
    Combinatorics and Computer Science, 1995, pp:218-233 [Conf]
  2. Joseph Cheriyan, András Sebö, Zoltán Szigeti
    An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:126-136 [Conf]
  3. Nicola Apollonio, András Sebö
    Minsquare Factors and Maxfix Covers of Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:388-400 [Conf]
  4. Jean Fonlupt, András Sebö
    On the Clique-Rank and the Coloration of Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:201-216 [Conf]
  5. András Frank, Alexander V. Karzanov, András Sebö
    On Multiflow Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:85-101 [Conf]
  6. Michael Lomonosov, András Sebö
    On the geodesic-structure of graphs: a polyhedral approach to metric decomposition. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:221-234 [Conf]
  7. Beth Novick, András Sebö
    On Combinatorial Properties of Binary Spaces. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:212-227 [Conf]
  8. Beth Novick, András Sebö
    On Ideal Clutters, Metrics and Multiflows. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:275-287 [Conf]
  9. András Sebö
    Hilbert Bases, Caratheodory's Theorem and Combinatorial Optimization. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:431-455 [Conf]
  10. András Sebö
    Forcing Colorations and the Strong Perfect Graph Conjecture. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:353-366 [Conf]
  11. András Sebö
    Circuit packings on surfaces with at most three cross-caps. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:433-446 [Conf]
  12. András Sebö
    Characterizing Noninteger Polyhedra with 0-1 Constraints. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:37-52 [Conf]
  13. András Sebö
    An Introduction to Empty Lattice Simplices. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:400-414 [Conf]
  14. András Sebö, László Szegö
    The Path-Packing Structure of Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:256-270 [Conf]
  15. András Sebö, Eric Tannier
    Connected Joins in Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:383-395 [Conf]
  16. Grigor Gasparyan, Myriam Preissmann, András Sebö
    Imperfect and Nonideal Clutters: A Common Approach. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:2, pp:283-302 [Journal]
  17. András Sebö
    The Schrijver system of odd join polyhedra. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:1, pp:103-116 [Journal]
  18. András Sebö, Zeev Waksman
    Optimal Binary Trees with Order Constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:305-311 [Journal]
  19. Karina Marcus, András Sebö
    Integer multiflows and metric packings beyond the cut condition. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:13-31 [Journal]
  20. András Sebö
    A Berge-keeping operation for graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2582-2592 [Journal]
  21. Yair Caro, András Sebö, Michael Tarsi
    Recognizing Greedy Structures. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:20, n:1, pp:137-156 [Journal]
  22. Wojciech Bienia, Luis A. Goddyn, Pavol Gvozdjak, András Sebö, Michael Tarsi
    Flows, View Obstructions, and the Lonely Runner. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:72, n:1, pp:1-9 [Journal]
  23. András Sebö
    Undirected distances and the postman-structure of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:49, n:1, pp:10-39 [Journal]
  24. András Sebö
    Integer Plane Multiflows with a Fixed Number of Demands. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:59, n:2, pp:163-171 [Journal]
  25. András Sebö
    General Antifactors of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:58, n:2, pp:174-184 [Journal]
  26. András Sebö
    On Critical Edges in Minimal Imperfect Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:67, n:1, pp:62-85 [Journal]
  27. András Sebö, Eric Tannier
    On Metric Generators of Graphs. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2004, v:29, n:2, pp:383-393 [Journal]
  28. András Sebö
    Potentials in Undirected Graphs and Planar Multiflows. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:582-603 [Journal]
  29. Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö
    Coloring the Maximal Cliques of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:17, n:3, pp:361-376 [Journal]
  30. Joseph Cheriyan, András Sebö, Zoltán Szigeti
    Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:2, pp:170-180 [Journal]
  31. András Frank, Alexander V. Karzanov, András Sebö
    On Integer Multiflow Maximization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:1, pp:158-170 [Journal]
  32. Edwin O'Shea, András Sebö
    Characterizations of Total Dual Integrality. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:382-396 [Conf]
  33. András Sebö
    A quick proof of Seymour's theorem on t-joins. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:64, n:1, pp:101-103 [Journal]
  34. Werner Schwärzler, András Sebö
    A generalized cut-condition for multiflows in matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:113, n:1-3, pp:207-221 [Journal]
  35. András Sebö
    Minmax relations for cyclically ordered digraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:4, pp:518-552 [Journal]

  36. Path Partitions, Cycle Covers and Integer Decomposition. [Citation Graph (, )][DBLP]


  37. Cyclic orders: Equivalence and duality. [Citation Graph (, )][DBLP]


  38. Optimizing diversity [Citation Graph (, )][DBLP]


  39. Generating All Sets With Bounded Unions. [Citation Graph (, )][DBLP]


  40. Batch processing with interval graph compatibilities between tasks. [Citation Graph (, )][DBLP]


  41. Paintshop, odd cycles and necklace splitting. [Citation Graph (, )][DBLP]


Search in 0.048secs, Finished in 0.049secs
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