BibSonomy :: author  ::

bookmarks

publications

(41)

• Generating All Sets With Bounded Unions.
  Yannick Frein and Benjamin Lévêque and András Sebö Combinatorics, Probability & Computing 17 641-660 (2008)
  to dblp by dblp on 2008-11-20 00:00:00
  | URL | BibTeX  
• Batch processing with interval graph compatibilities between tasks.
  Gerd Finke and Vincent Jost and Maurice Queyranne and András Sebö Discrete Applied Mathematics 156 556-568 (2008)
  to dblp by dblp on 2008-06-24 00:00:00
  | URL | BibTeX  
• Cyclic orders: Equivalence and duality.
  Pierre Charbit and András Sebö Combinatorica 28 131-143 (2008)
  to dblp by dblp on 2008-05-27 00:00:00
  | URL | BibTeX  
• Sequential search using question-sets with bounded intersections
  Andr{\'a}s Sebo Journal of Statistical Planning and Inference 7 139--150 (1982)
  to Search problem by smicha on 2008-04-23 22:05:04
  | URL | BibTeX  
• On two random search problems
  Andr{\'a}s Sebo Journal of Statistical Planning and Inference 11 23--31 (1985)
  to Sequential by smicha on 2008-04-23 22:05:04
  | URL | BibTeX  
• Optimizing diversity
  Yannick Frein and Benjamin Lévêque and András Sebö CoRR abs/0711.2998 (2007)
  to dblp by dblp on 2008-01-02 00:00:00
  | URL | BibTeX  
• Minmax relations for cyclically ordered digraphs.
  András Sebö J. Comb. Theory, Ser. B 97 518-552 (2007)
  to dblp by dblp on 2007-09-20 00:00:00
  | URL | BibTeX  
• A generalized cut-condition for multiflows in matroids.
  Werner Schwärzler and András Sebö Discrete Mathematics 113 207-221 (1993)
  to dblp by dblp on 2007-07-04 00:00:00
  | URL | BibTeX  
• Characterizations of Total Dual Integrality.
  Edwin O'Shea and András Sebö IPCO 382-396 (2007)
  to dblp by dblp on 2007-06-28 00:00:00
  | URL | BibTeX  
• A quick proof of Seymour's theorem on t-joins.
  András Sebö Discrete Mathematics 64 101-103 (1987)
  to dblp by dblp on 2007-06-17 00:00:00
  | URL | BibTeX