This file was created with JabRef 1.7.1.
Encoding: Cp1252

@STRING{AC = {Ars Combinatoria}}

@STRING{AI = {Artificial Intelligence}}

@STRING{AMAI = {Annals of Mathematics and Artificial Intelligence}}

@STRING{AOR = {Annals of Operations Research}}

@STRING{CACM = {Communications of the Association for Computing Machinery}}

@STRING{CAI = {Computers and Artificial Intelligence}}

@STRING{CC = {Computational Complexity}}

@STRING{CI = {Computational Intelligence}}

@STRING{COM = {Combinatorica}}

@STRING{DAM = {Discrete Applied Mathematics}}

@STRING{CGTA = {Computational Geometry: Theory and Applications}}

@STRING{DCG = {Discrete and Computational Geometry}}

@STRING{DIMACS = {96 Frelinghuysen Road, Piscataway, NJ 08854-8018, USA}}

@STRING{DM = {Discrete Mathematics}}

@STRING{DS = {Decision Sciences}}

@STRING{DTR = {DIMACS Technical Report}}

@STRING{EJC = {European Journal of Combinatorics}}

@STRING{EJOR = {European Journal of Operations Research}}

@STRING{GD = {Geometriae Dedicata}}

@STRING{IC = {Information and Computation}}

@STRING{IEEEE = {IEEE Expert}}

@STRING{IEEEPAMI = {IEEE Transactions on Pattern Analysis and Machine Intelligence}}

@STRING{IEEETC = {IEEE Transactions on Computers}}

@STRING{IEEETKDE = {IEEE Transactions on Knowledge and Data Engineering}}

@STRING{IPL = {Information Processing Letters}}

@STRING{JA = {Journal of Algorithms}}

@STRING{JACM = {Journal of the Association for Computing Machinery}}

@STRING{JAIR = {Journal of Artifical Intelligence Research}}

@STRING{JCTA = {Journal of Combinatorial Theory (A)}}

@STRING{JCTB = {Journal of Combinatorial Theory (B)}}

@STRING{JGT = {Journal of Graph Theory}}

@STRING{JLP = {Journal of Logic Programming}}

@STRING{JSL = {Journal of Symbolic Logic}}

@STRING{LAA = {Linear Algebra and Its Applications}}

@STRING{LNCS = {Lecture Notes in Computer Science}}

@STRING{MASS = {Mathematical Social Sciences}}

@STRING{ML = {Machine Learning}}

@STRING{MOR = {Mathematics of Operations Research}}

@STRING{MP = {Mathematical Programming}}

@STRING{MPB = {Mathematical Programming (B)}}

@STRING{MS = {Management Science}}

@STRING{NRL = {Naval Research Logistics}}

@STRING{NET = {Networks}}

@STRING{OMS = {Optimization Methods and Software}}

@STRING{OR = {Operations Research}}

@STRING{ORSAJC = {ORSA Journal on Computing}}

@STRING{ORL = {Operations Research Letters}}

@STRING{PPL = {Parallel Processing Letters}}

@STRING{RRR = {RUTCOR Research Report}}

@STRING{RU = {Rutgers University}}

@STRING{RUTCOR = {640 Bartholomew Road, Piscataway, NJ 08854-8003, USA}}

@STRING{SIAMDM = {SIAM Journal on Discrete Mathematics}}

@STRING{SIAMJC = {SIAM Journal on Computing}}

@STRING{SIAMJAM = {SIAM Journal on Applied Mathematics}}

@STRING{SIAMOPT = {SIAM Journal on Optimization}}

@STRING{TCS = {Theoretical Computer Science}}

@STRING{ZAMM = {Z. Angewandte Math. Mech.}}

@STRING{ZORA = {Zeitschrift f{\"{u}}r Operations Research, Serie (A)}}

@PHDTHESIS{Abd03,
  author = {S.D. Abdullahi},
  title = {Vertex Enumeration and Counting for Certain Classes of Polyhedra},
  school = {Computing (Computer Algorithms) Leeds University U.K.},
  year = {2003},
}

@ARTICLE{AK95,
  author = {E. Amaldi and V. Kann},
  title = {The complexity of approximability of finding maximum feasible subsystems of linear relations},
  journal = TCS,
  year = {1995},
  volume = {147},
  pages = {181-210},
}

@ARTICLE{ABS97,
  author = {D. Avis and B. Bremner and R. Seidel},
  title = {How good are convex hull algorithms},
  journal = CGTA,
  year = {1997},
  volume = {7},
  pages = {265-302},
}

@ARTICLE{AF92,
  author = {D. Avis and K. Fukuda},
  title = {A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra},
  journal = DCG,
  year = {1992},
  volume = {8},
  pages = {295--313},
  number = {3},
  address = {Secaucus, NJ, USA},
  issn = {0179-5376},
  publisher = {Springer-Verlag New York, Inc.},
}

@article{AF96,
 author = {D. Avis and K. Fukuda},
 title = {Reverse search for enumeration},
 journal = DAM,
 volume = {65},
 number = {1-3},
 year = {1996},
 issn = {0166-218X},
 pages = {21--46},
 doi = {http://dx.doi.org/10.1016/0166-218X(95)00026-N},
 publisher = {Elsevier Science Publishers B. V.},
 address = {Amsterdam, The Netherlands, The Netherlands},
}

@ARTICLE{Bal61,
  AUTHOR =       {M.L. Balinski},
  TITLE =        {An algorithm for finding all vertices of convex polyhedral sets},
  JOURNAL =      SIAMJAM,
  YEAR =         {1961},
  volume =       {9},
  number =       {},
  pages =        {72-81},
}

@ARTICLE{BI95,
  author = {J.C. Bioch and T. Ibaraki},
  title = {Complexity of identification and dualization of positive {B}oolean functions},
  journal = IC,
  year = {1995},
  volume = {123},
  pages = {50-63},
}

@INPROCEEDINGS{BEG04-ESA-blockers,
  author = {E. Boros and K. Elbassioni and V. Gurvich},
  title = {Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems},
  booktitle = {Algorithms -- ESA 2004, 12th Annual European Symposium},
  year = {2004},
  editor = {Susanne Albers and Tomasz Radzik},
  volume = {3221},
  series = LNCS,
  pages = {122-133},
  address = {Berlin, Heidelberg, New York},
  month = {September},
  publisher = {Springer},
  note = {Bergen, Norway, September 14-17, 2004},
}

@INPROCEEDINGS{BEGK04-IPCO-dicuts,
  author = {E. Boros and K. Elbassioni and V. Gurvich and L. Khachiyan},
  title = {Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems},
  booktitle = {Integer Programming and Combinatorial Optimization, 10th International {IPCO} Conference, New York, NY, USA},
  year = {2004},
  editor = {D. Bienstock and G. Nemhauser},
  volume = {3064},
  series = LNCS,
  pages = {152-162},
  address = {Berlin, Heidelberg, New York},
  month = {June 7-11},
  publisher = {Springer},
  note = {(RRR 36-2003)},
}


@ARTICLE{Bre99,
  AUTHOR =       {D. Bremner},
  TITLE =        {Incremental convex hull algorothms are not output sensitive},
  JOURNAL =      DCG,
  YEAR =         {1999},
  volume =       {21},
  number =       {},
  pages =        {57-68},
}

@ARTICLE{BFM98,
  AUTHOR =       {D. Bremner and K. Fukuda and A. Marzetta},
  TITLE =        {Primal-dual methods for vertex and facet enumeration},
  JOURNAL =      DCG,
  YEAR =         {1998},
  volume =       {20},
  number =       {},
  pages =        {333-357},
}


@ARTICLE{BL98,
  author = {M.~R. Bussieck and M.~E. L{\"{u}}bbecke},
  title = {The vertex set of a 0/1 polytope is strongly $\mathcal{P}$-enumerable},
  journal = CGTA,
  year = {1998},
  volume = {11},
  pages = {103-109},
  number = {2},
}

@ARTICLE{Cha94,
  AUTHOR =       {N. Chakravarti},
  TITLE =        {Some Results Concerning Post-Infeasibility Analysis},
  JOURNAL =      EJOR,
  YEAR =         {1994},
  volume =       {73},
  number =       {},
  pages =        {139-143},
}


@article{CK70,
 author = {D.R. Chand and S.S. Kapur},
 title = {An Algorithm for Convex Polytopes},
 journal = JACM,
 volume = {17},
 number = {1},
 year = {1970},
 issn = {0004-5411},
 pages = {78--86},
 doi = {http://doi.acm.org/10.1145/321556.321564},
 publisher = {ACM Press},
 address = {New York, NY, USA},
 }

@BOOK{CCH53,
  title = {An Introduction to Linear Programming},
  publisher = {Wiley},
  year = {1953},
  author = {A. Charnes and W.W. Cooper and A. Henderson},
  address = {New York},
}


@BOOK{Chv83,
  AUTHOR =       {V. Chv\'{a}tal},
  TITLE =        {Linear Programming},
  PUBLISHER =    {Freeman},
  YEAR =         {1983},
  address =      {San Francisco, CA},
}

@BOOK{S86,
  AUTHOR =       {A. Schrijver},
  TITLE =        {Theory of Linear and Integer Programming},
  PUBLISHER =    {Wiley},
  YEAR =         {1986},
  address =      {New York},
}

@BOOK{V01,
  AUTHOR =       {V.~V.~Vazirani},
  TITLE =        {Approximation Algorithms},
  PUBLISHER =    {Springer Verlag},
  YEAR =         {2001},
  address =      {Berlin, Heidelberg, New York},
}

@INPROCEEDINGS{Coo71,
  AUTHOR =       {S.A. Cook},
  TITLE =        {The Complexity of Theorem Proving Procedures},
  BOOKTITLE =    {Proceedings of the Third Annual ACM Symposium on Theory of Computing},
  YEAR =         {1971},
  editor =       {},
  volume =       {},
  number =       {},
  series =       {},
  pages =        {151-158},
}


@ARTICLE{Dye83,
  author = {M.E. Dyer},
  title = {The complexity of vertex enumeration methods},
  journal = MOR,
  year = {1983},
  volume = {8},
  pages = {381-402},
}

@ARTICLE{DP77,
  author = {M.E. Dyer and L.G. Proll},
  title = {An algorithms for determining all extreme points of a convex polytope},
  journal = MP,
  year = {1977},
  volume = {12},
  pages = {81-96},
}

@ARTICLE{EG95,
  AUTHOR =       {T. Eiter and G. Gottlob},
  TITLE =        {Identifying the minimal transversals of a hypergraph and related problems},
  JOURNAL =      SIAMJC,
  YEAR =         {1995},
  volume =       {24},
  number =       {},
  pages =        {1278-1304},
}

@ARTICLE{Far1901,
  AUTHOR =       {J. Farkas},
  TITLE =        {Theorie der einfachen Ungleichungen},
  JOURNAL =      {Journal f{\"{u}}r die reine und angewandte Mathematik},
  YEAR =         {1901},
  volume =       {124},
  number =       {},
  pages =        {1-27},
}


@ARTICLE{FK96,
  author = {M. Fredman and L. Khachiyan},
  title = {On the complexity of dualization of monotone disjunctive normal forms},
  journal = JA,
  year = {1996},
  volume = {21},
  pages = {618-628},
}

@ARTICLE{FN95,
  author = {K. Fukuda and M. Namiki},
  title = {Finding All Common Bases in Two Matroids},
  journal = DAM,
  year = {1995},
  volume = {56},
  pages = {231-243},
  number = {2-3},
}

@ARTICLE{FM92,
  AUTHOR =       {K. Fukuda and T. Matsui},
  TITLE =        {Finding all minimum cost perfect matchings in bipartite graphs},
  JOURNAL =      NET,
  YEAR =         {1992},
  volume =       {22},
  number =       {},
  pages =        {461--468},
}

@ARTICLE{FM94,
  AUTHOR =       {K. Fukuda and T. Matsui},
  TITLE =        {Finding all the perfect matchings in bipartite graphs},
  JOURNAL =      {Appl. Math. Lett.},
  YEAR =         {1994},
  volume =       {7},
  number =       {1},
  pages =        {15--18},
}

@ARTICLE{FLM97,
  AUTHOR =       {K. Fukuda and Th. M. Liebling and F. Margot},
  TITLE =        {Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron},
  JOURNAL =      {CGTA},
  YEAR =         {1997},
  volume =       {8},
  number =       {},
  pages =        {1-12},
}


@BOOK{GJ79,
  title = {Computers and Intractability},
  publisher = {Freeman},
  year = {1979},
  author = {M.R. Garey and D.S. Johnson},
  address = {New York},
}

@ARTICLE{Gal58,
  AUTHOR =       {T. Gallai},
  TITLE =        {Maximum-minimum S{\"{a}}tze {\"{u}}ber Graphen},
  JOURNAL =      {Acta Mathematicae, Academiae Scientiarum Hungaricae},
  YEAR =         {1958},
  volume =       {9},
  number =       {},
  pages =        {395-434},
}

@ARTICLE{GR90,
  AUTHOR =       {J. Gleeson and J. Ryan},
  TITLE =        {Identifying minimally infeasible subsystems of inequalities},
  JOURNAL =      ORSAJC,
  YEAR =         {1990},
  volume =       {2},
  number =       {1},
  pages =        {61-63},
}

@article{JP78,
  author    = {D.S. Johnson and F.P. Preparata},
  title     = {The Densest Hemisphere Problem},
  journal   = TCS,
  volume    = {6},
  year      = {1978},
  pages     = {93-107},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@ARTICLE{Kar78,
  AUTHOR =       {R. Karp},
  TITLE =        {A Characterization of the Minimum Cycle Mean in a Digraph},
  JOURNAL =      DM,
  YEAR =         {1978},
  volume =       {23},
  number =       {},
  pages =        {309--311},
}


@ARTICLE{Kha79,
  AUTHOR =       {L. Khachiyan},
  TITLE =        {A Polynomial algorithm in linear programming},
  JOURNAL =      {Soviet Math. Dokl.},
  YEAR =         {1979},
  volume =       {20},
  pages =        {191-194},
}

@INCOLLECTION{Kha00,
  author = {L. Khachiyan},
  title = {Transversal hypergraphs and families of polyhedral cones},
  booktitle = {Advances in Convex Analysis and
     Global Optimization, Honoring the memory of {K}. {C}arath{\'{e}}odory},
  publisher = {Kluwer Academic Publishers},
  year = {2000},
  editor = {N. Hadjisavvas and P. Pardalos},
  pages = {105--118},
  address = {Dordrecht/Boston/London},
}

@ARTICLE{LLK80,
  author = {E. Lawler and J.~K. Lenstra and A.~H.~G. Rinnooy Kan},
  title = {Generating all maximal independent sets: {NP}-hardness and polynomial-time algorithms},
  journal = SIAMJC,
  year = {1980},
  volume = {9},
  pages = {558-565},
}

@TECHREPORT{Lov92,
  author = {L. Lov\'{a}sz},
  title = {Combinatorial Optimization: some Problems and Trends},
  institution = {Rutgers University},
  year = {1992},
  type = {DIMACS Technical Report},
  number = {92-53},
}

@TECHREPORT{BEGM07,
  author = {B. Boros and K. Elbassioni and V. Gurvich and K. Makino},
  title = {Generating vertices of polyhedra and related monotone generation problems},
  institution = {Rutgers University},
  year = {2007},
  type = {DIMACS Technical Report},
  number = {2007-03},
}

@ARTICLE{Mat73,
  AUTHOR =       {T.H. Mattheiss},
  TITLE =        {An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities},
  JOURNAL =      OR,
  YEAR =         {1973},
  volume =       {21},
  number =       {},
  pages =        {247-260},
}


@INPROCEEDINGS{MRTT53,
  author = {T.S. Motzkin and H. Raiffa and G.L. Thompson and R.M. Thrall},
  title = {The double description method},
  booktitle = {Contributions to the Theory of Games},
  year = {1953},
  editor = {H.W. Kuhn and A.W. Tucker},
  volume = {II},
  pages = {51-73},
}

@PHDTHESIS{Pfe02,
  author = {M.~E. Pfetsch},
  title = {The Maximum Feasible Subsystem Problem and Vertex-Facet Incidences of Polyhedra},
  school = {TU Berlin},
  year = {2002},
  type = {Dissertation},
}

@article{P94,
 author = {J.S. Provan},
 title = {Efficient enumeration of the vertices of polyhedra associated with network LP's},
 journal = MP,
 volume = {63},
 number = {1},
 year = {1994},
 issn = {0025-5610},
 pages = {47--64},
 publisher = {Springer-Verlag New York, Inc.},
 address = {Secaucus, NJ, USA},
 }

@ARTICLE{RT75,
  author = {R.~C. Read and R.~E. Tarjan},
  title = {Bounds on backtrack algorithms for listing cycles, paths, and spanning trees},
  journal = {Networks},
  year = {1975},
  volume = {5},
  pages = {237-252},
}

@ARTICLE{Rya96,
  author = {J. Ryan},
  title = {{IIS}-hypergraphs},
  journal = SIAMDM,
  year = {1996},
  volume = {9},
  pages = {643--653},
  number = {4},
}

@PHDTHESIS{Sei86,
  AUTHOR =       {R. Seidel},
  TITLE =        {Output-size sensitive algorithms for constructive problems in computational geometry},
  SCHOOL =       {Cornell University},
  YEAR =         {1986},
  type =         {Computer Science},
  address =      {Ithaka, NY},
}



@ARTICLE{SEYM94,
  author = {P.D. Seymour},
  title = {A note on hyperplane generation},
  journal = JCTB,
  year = {1994},
  volume = {61},
  pages = {88-91},
}

@ARTICLE{SU03,
  author = {F. Stork and M. Uetz},
  title = {On the Generation of Circuits and Minimal Forbidden Sets},
  journal = MP,
  year = {2003},
  note = {to appear},
}

@ARTICLE{Swa85,
  AUTHOR =       {G. Swart},
  TITLE =        {Finding the convex hull facet by facet},
  JOURNAL =      JA,
  YEAR =         {1985},
  volume =       {6},
  number =       {},
  pages =        {17-48},
}


@INPROCEEDINGS{Uno97,
  author = {T. Uno},
  title = {Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs},
  booktitle = {8th International Symposium on Algorithms and Computation, {ISAAC} 1997},
  year = {1997},
  volume = {1350},
  series = {Lecture Notes in Computer Science},
  pages = {92-101},
  publisher = {Springer Verlag},
}


@ARTICLE{Val79,
  author = {L.G. Valiant},
  title = {The complexity of enumeration and reliability problems},
  journal = SIAMJC,
  year = {1979},
  volume = {8},
  pages = {410-421},
}


@inproceedings{ADP03,
  author    = {S.~D.~Abdullahi and
               M.~E.~Dyer and
               L.~G.~Proll},
  title     = {Listing Vertices of Simple Polyhedra Associated with Dual
               \text{LI}(2) Systems},
  booktitle = {DMTCS: Discrete Mathematics and Theoretical Computer Science, 4th
               International Conference, DMTCS 2003, Proceedings},
  year      = {2003},
  pages     = {89-96},
  ee        = {http://link.springer.de/link/service/series/0558/bibs/2731/27310089.htm},
  crossref  = {DBLP:conf/dmtcs/2003},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{KBBEG06,
  author    = {L.~Khachiyan and
               E.~Boros and
               K.~Borys and
               K.~Elbassioni and
               V.~Gurvich},
  title     = {Generating all vertices of a polyhedron is hard},
  booktitle = {Proceedings of the Seventeenth Annual ACM-SIAM Symposium
               on Discrete Algorithms, SODA 2006},
  year      = {2006},
  pages     = {758-765, Extended version to appear in {\em Discerte \& Computational Geometry}},
  ee        = {http://doi.acm.org/10.1145/1109557.1109640},
  crossref  = {DBLP:conf/soda/2006},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{GV95,
 author = {N.~Garg and V.~V.~Vazirani},
 title = {A polyhedron with all s-t cuts as vertices, and adjacency of cuts},
 journal = {Math. Program.},
 volume = {70},
 number = {1},
 year = {1995},
 issn = {0025-5610},
 pages = {17--25},
 doi = {http://dx.doi.org/10.1007/BF01585926},
 publisher = {Springer-Verlag New York, Inc.},
 address = {Secaucus, NJ, USA},
 }

@article{PY90,
  author    = {C.~H.~Papadimitriou and
               M.~Yannakakis},
  title     = {On recognizing integer polyhedra},
  journal   = {Combinatorica},
  volume    = {10},
  number    = {1},
  year      = {1990},
  pages     = {107-109},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{DFZ07,
 author = {G.~Ding and L.~Feng and W. Zang},
 title = {The complexity of recognizing linear systems with certain integrality properties},
 journal = {Math. Program., Ser. A., to appear},
 volume = {},
 number = {},
 year = {2007},
 issn = {},
 pages = {},
 doi = {http://dx.doi.org/10.1007/s10107-007-0103-y},
 publisher = {Springer-Verlag New York, Inc.},
 address = {Secaucus, NJ, USA},
 }

@inproceedings{BHK04,
  author    = {A. Bj{\"o}rklund and
               T. Husfeldt and
               S. Khanna},
  title     = {Approximating Longest Directed Paths and Cycles},
  booktitle = {ICALP},
  year      = {2004},
  pages     = {222-233},
  ee        = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3142{\&}spage=222},
  crossref  = {DBLP:conf/icalp/2004},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}