The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Claire Kenyon-Mathieu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Claire Kenyon-Mathieu, Jeffrey Scott Vitter
    General Methods for the Analysis of the Maximum Size of Dynamic Data Structures (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:473-487 [Conf]
  2. Claire Kenyon-Mathieu, Valerie King
    Verifying Partial Orders [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:367-374 [Conf]
  3. Claire Kenyon-Mathieu, Jeffrey Scott Vitter
    The Maximum Size of Dynamic Data Structures. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:5, pp:807-823 [Journal]
  4. Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
    Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:171-182 [Conf]
  5. Wenceslas Fernandez de la Vega, Claire Kenyon-Mathieu
    Linear programming relaxations of maxcut. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:53-61 [Conf]
  6. Glencora Borradaile, Claire Kenyon-Mathieu, Philip N. Klein
    A polynomial-time approximation scheme for Steiner tree in planar graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1285-1294 [Conf]
  7. Claire Kenyon-Mathieu, Warren Schudy
    How to rank with few errors. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:95-103 [Conf]

  8. How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
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