Welcome to the homepage of ConCoCO
(Concordia Computational Combinatorial Optimization Laboratory)

Concordia University
1515 Ste. Catherine St. West
Montreal, QC H3G 1M8
Last updated on: October 31, 2011
Research Areas:
Members:
Faculty:
- Vašek Chvátal
- Stan Klasa
- Clement Lam

Research Associate:
- François Genest

Postdoctoral Fellow:
- Ehsan Chiniforooshan

Graduate Students:
- Tanbir Ahmed
- Majid Behbahani
- Mark Goldsmith
- Azam Heydari
- Hiba Tabbara
- Yuan Yao

[Back to Top]
External Members:
Faculty:
- Luc Devroye (McGill)
Graduate Students:
- Victor Campos (McGill)
- Greg Costain (McGill)
- Rohan Kapadia (McGill)
- Sean Kennedy (McGill)
- Neil Olver (McGill)
- Narges Simjour (Waterloo)
- Perouz Taslakian (McGill)
- Nithum Thain (McGill)
[Back to Top]
Visitors:
[Back to Top]
[LINKS]: [PUBLICATIONS]
[LIBRARY]
[OPEN PROBLEMS]
[CONFERENCES]
[JOURNALS]
[PEOPLE]
[SOFTWARE/LIBRARIES/INSTANCES/BENCHMARKS]
[GROUPS]
[PAGES PROVIDING POINTERS]
Seminars:
[FUTURE]
[PAST]
  • Tuesday, November 8, 16:00, EV3.101
    Yori Zwols, "Computing the polyhedron of realizable marginals".
  • Tuesday, November 1, 16:00, EV3.101
    Vašek Chvátal, "Representing conjunctive forks, cont'd".
  • Tuesday, October 25, 16:00, EV3.101
    Vašek Chvátal, "Recognizing covariances".
  • Tuesday, October 18, 16:00, EV3.101
    Yori Zwols, "On representing betweennesses".
  • Tuesday, October 11, 16:00, EV3.101
    Vašek Chvátal, "Representing conjunctive forks".
  • Tuesday, October 4, 16:00, EV3.101
    Vašek Chvátal, "Linear programming and conjunctive forks".
  • Tuesday, September 26, 15:00, EV3.101
    Yori Zwols, "Covariances and conjunctive forks".
  • Tuesday, September 19, 15:00, EV3.101
    Vašek Chvátal, "Conjunctive forks".
  • Tuesday, April 5, 15:00, EV3.101
    Mario Antoine Aoun, "STDP within NDS Neurons".
  • Tuesday, March 29, 15:00, EV3.101
    Vašek Chvátal, "Isomorphism types of strict betweenness".
  • Tuesday, March 22, 15:00, EV3.101
    Vašek Chvátal, "Concerning common cause".
  • Tuesday, March 15, 15:00, EV3.101
    Yori Zwols, "Information theory".
  • Tuesday, March 8, 15:00, EV3.101
    Vašek Chvátal, "Reichenbach's common cause", continued.
  • Tuesday, March 1, 15:00, EV3.101
    Vašek Chvátal, "Reichenbach's common cause".
  • Tuesday, Feb 22, 15:00, EV3.101
    Nicolas Fraiman, "Notes on selection vertex games".
  • Tuesday, Feb 15, 15:00, EV3.101
    Yori Zwols, "Vertex selection games".
  • Tuesday, Feb 8, 15:00, EV3.101
    Vašek Chvátal, "On node selection games", continued.
  • Tuesday, Feb 2, 15:00, EV3.101
    Vašek Chvátal, "On node selection games".
  • Tuesday, Jan 25, 15:00, EV3.101
    Mark Goldsmith, "What is a random sequence?", continued.
  • Tuesday, Jan 18, 15:00, EV3.101
    Mark Goldsmith, "What is a random sequence?"
  • Tuesday, Jan 11, 15:00, EV3.101
    Mark Goldsmith, "Tests for random sequences".

    [2010]

  • Tuesday, Feb 8, 15:00, EV3.101
    Vašek Chvátal, "On node selection games...".
  • Tuesday, Feb 8, 15:00, EV3.101
    Vašek Chvátal, "On node selection games...".
  • Wednesday, May 5, 15:30, EV3.101
    Vašek Chvátal, "On node selection games...".
  • Wednesday, April 28, 15:30, EV3.101
    Vašek Chvátal "On node selection games".
  • Wednesday, April 7, 15:30, EV3.101
    Vašek Chvátal and Neil Olver, "A generic property of symmetric Games".
  • Wednesday, March 31, 15:30, EV3.101
    Vašek Chvátal, "Zero-Sum Games".
  • Wednesday, Jan 27, 15:30, EV3.101
    "2-d chaotic maps and Takens Theorem".
  • Wednesday, Jan 20, 15:30, EV3.101
    Mark Goldsmith, "The maximal Lyapunov exponent of a time series".

    [2009]

  • Tuesday, Nov 24, 15:30, EV3.101
    Luc Devroye , "Monochromatic absorbing sets in tournaments".
  • Tuesday, Nov 16, 15:30, EV3.101
    "Neuronal complexity loss".
  • Tuesday, Nov 9, 15:30, EV3.101
    "Inability of Lyapunov exponents to predict epileptic seizures".
  • Tuesday, Oct 26, 15:30, EV3.101
    "Overview on predicting epileptic seizures".
  • Tuesday, Oct 6, 15:30, EV3.101
    Laurent Beaudou, "Absorbing sets in tournaments".
  • Tuesday, Sept 29, 15:30, EV3.101
    Nithum Thain, "Automatic recognition of interictal spikes".
  • Tuesday, Sept 22, 15:30, EV3.101
    Vašek Chvátal, "On maximal Lyapunov exponents".
  • Tuesday, Sept 15, 15:30, EV3.101
    Marketa Vyskocilova, "Seizure EEG analysis".
  • Thursday, July 15, 14:00, EV3.101
    Annie Raymond, "Small Chvátal Rank".
  • Thursday, June 25, 16:00, EV3.101
    Neil Olver, "An application of Kolmogorov Complexity".
  • Thursday, June 18, 16:00, EV3.101
    Ehsan Chiniforooshan, "An Introduction to Kolmogorov Complexity".
  • Thursday, June 11, 16:00, EV3.101
    Ehsan Chiniforooshan, "An Introduction to Kolmogorov Complexity".
  • Thursday, April 16, 16:00, EV2.184
    Adrian Bondy, "Paths and Stable Sets in Directed Graphs". (Department Seminar)
  • Wednesday, April 15, 12:00, EV2.184
    U. S. R. Murty, "The Perfect Matching Polytope and Solid Bricks". (Department Seminar)
  • Thursday, April 02, 16:00, EV3.101
    Luc Devroye, Ehsan Chiniforooshan, "On the theory of branching rules".
  • Thursday, Mar 26, 16:00, EV3.101
    Vašek Chvátal, Ehsan Chiniforooshan, "On the theory of branching rules".
  • Thursday, Mar 12, 16:00, EV3.101
    Ehsan Chiniforooshan, "Theoretical results on satisfiability of random k-SAT formulas".
  • Thursday, Mar 5, 16:00, EV3.101
    Mark Kayll, "Discrete meets Continous: counting matchings with integrals".
  • Thursday, Feb 26, 16:00, EV3.101
    Vašek Chvátal, "On the theory of branching rules".
  • Thursday, Feb 19, 16:00, EV3.101
    Arash Rafiey, "On the graph homomorphism problem and its applications".
  • Thursday, Feb 12, 16:00, EV3.101
    Vašek Chvátal, "On the theory of branching rules".
  • Thursday, Feb 05, 16:00, EV3.101
    Vašek Chvátal, "On the theory of branching rules".
  • Thursday, Jan 29, 16:00, EV3.101
    Azam Heydari, "Branching rules".
  • Thursday, Jan 22, 16:00, EV3.101
    Vašek Chvátal, "On the theory of branching rules".
  • Thursday, Jan 15, 16:00, EV3.101
    Vašek Chvátal, Ehsan Chiniforooshan, "On the theory of branching rules".

    [2008]

  • Tuesday, Nov 27, 14:00, EV3.101
    Baoyindureng Wu, Ehsan Chiniforooshan, Vašek Chvátal, "On the t-improper chromatic number of Graphs".
  • Tuesday, Nov 13, 14:00, EV3.101
    Baoyindureng Wu, Ehsan Chiniforooshan, "On the t-improper chromatic number of Graphs".
  • Thursday, Oct 30, 14:00, EV3.101
    Vašek Chvátal, "Popularity in Intersecting Hypergraphs".
  • Thursday, Oct 23, 14:00, EV3.101
    Arnaud Chadozeau , "Popularity in Intersecting Hypergraphs".
  • Thursday, Oct 16, 14:00, EV3.101
    Tanbir Ahmed, "On the bounds and exact values of van der Waerden numbers;
    Some previously unknown van der Waerden numbers (and some van der Waerden type numbers)".
  • Thursday, Oct 09, 14:00, EV3.101
    Ehsan Chiniforooshan, "On the bounds of Erdös and Szekeres à la Genest".
  • Thursday, Oct 02, 14:00, EV3.101
    Vašek Chvátal "Erdös and Szekeres à la Genest".
  • Tuesday, August 19, 15:00, EV3.101
    Vašek Chvátal "Computational model of the Neurons".
  • Tuesday, August 12, 15:00, EV3.101
    Laurent Beaudou, Ehsan Chiniforooshan, Vašek Chvátal "Convexity and Betweenness".
  • Wednesday, August 06, 16:00, EV3.101
    Laurent Beaudou, Ehsan Chiniforooshan, Vašek Chvátal "Convexity and Betweenness".
  • Tuesday, July 29, 15:00, EV3.101
    Laurent Beaudou, Ehsan Chiniforooshan, Vašek Chvátal "Convexity and Betweenness".
  • Tuesday, July 22, 15:00, EV3.101
    Laurent Beaudou, Ehsan Chiniforooshan, Vašek Chvátal "Convexity and Betweenness".
  • Tuesday, July 15, 15:00, EV3.101
    Ehsan Chiniforooshan, Vašek Chvátal "Convexity and Betweenness".
  • Thursday, July 10, 15:00, EV3.101
    Ehsan Chiniforooshan, Vašek Chvátal "Convexity and Betweenness".
  • Thursday, July 03, 16:00, EV3.101
    Vašek Chvátal "Review of problems discussed so far".
  • Tuesday, June 03, 16:00, EV3.101
    Vašek Chvátal "Convexity and Betweenness".
  • Tuesday, May 27, 16:00, EV3.101
    Laurent Beaudou, "Colouring the square of a bipartite planar graph".
  • Tuesday, May 20, 16:00, EV3.101
    Majid Karimi Behbahanim, "Covering R^3 with tetrahedrons".
    Ehsan Chiniforooshan "Weak tree-width of graphs".
  • Tuesday, May 13, 16:00, EV3.101
    Vašek Chvátal "Convexity and Betweenness".
  • Tuesday, May 06, 16:00, EV3.101
    Laurent Beaudou, "On the Middle Levels Problem".
  • Wednesday, Apr 30, 16:00, EV3.101
    Baoyindureng Wu, "Connectivity and Matching".
    Laurent Beaudou, "Isometric embeddings".
  • Wednesday, Apr 23, 16:00, EV3.101
    Laurent Beaudou, "Isometric embeddings".
  • Wednesday, Apr 16, 16:00, EV3.101
    Ehsan Chiniforooshan, "On the number of crossing-free perfect matchings of a Graph".
  • Wednesday, Apr 09, 16:00, EV3.101
    Baoyindureng Wu, "On the bounds of the cop number of a Graph".
    Ehsan Chiniforooshan, "On the bounds of the cop number of a Graph".
    Greg Costain, "On a generalization of the Traversal by Prime Sum problem".
    Vašek Chvátal "Betweenness and Convexity in Euclidean spaces".
  • Wednesday, Mar 26, 16:00, EV3.101
    Ehsan Chiniforooshan, Vašek Chvátal and Baoyindureng Wu, "On the cop number of Mycielski Graphs".
  • Wednesday, Mar 19, 16:00, EV3.101
    Ehsan Chiniforooshan, "On the cop number of a graph".
    Neil Olver, "Retracts of the incidence graph of Projective planes".
  • Wednesday, Mar 12, 16:00, EV3.101
    Victor Campos, "On the variations of the cop number of a graph".
    Vašek Chvátal, "On the cop number of the incidence graph of Projective planes".
  • Wednesday, Mar 05, 16:00, EV3.101
    Ehsan Chiniforooshan, "On the cop number of a graph".
  • Wednesday, Feb 27, 16:00, EV3.101
    Ehsan Chiniforooshan, "On the cop number of a graph".
  • Wednesday, Feb 20, 16:00, EV3.101
    Perouz Taslakian and Victor Campos, "Transversals in Trees".
  • Wednesday, Feb 13, 16:00, EV3.101
    Vašek Chvátal, "Matroids".
  • Wednesday, Feb 06, 16:00, EV3.101
    Nithum Thain and Greg Costain, "On a generalization of the Traversal by Prime Sum problem".

    [2007]

  • Wednesday, Dec 05, 16:00, EV3.101
    Vašek Chvátal, "Conjectures on Tough graphs; Independence system of sets".
  • Wednesday, Nov 28, 16:00, EV3.101
    Ehsan Chiniforooshan, "On the Chen-Chvátal conjecture".
  • Wednesday, Nov 21, 16:00, EV3.101
    Narges Simjour, on Woeginger's paper "Exact algorithms for NP-Hard problems: a survey" (Continued...).
    Ehsan Chiniforooshan, "On the cop number of a graph".
  • Wednesday, Nov 14, 16:00, EV3.101
    Narges Simjour, on Woeginger's paper "Exact algorithms for NP-Hard problems: a survey".
  • Wednesday, Nov 7, 16:00, EV3.101
    Ehsan Chiniforooshan, "Intersperse Coloring".
  • Wednesday, Oct 31, 16:00, EV3.101
    Tanbir Ahmed, "An improved exponential-time algorithm for k-SAT - paper by Ramamohan Paturi, Pavel Pudlák, Mike Saks, and Francis Zane" (Continued...).
  • Wednesday, Oct 24, 16:00, EV3.101
    Vašek Chvátal "On a combinatorial problem".
    Tanbir Ahmed, "An improved exponential-time algorithm for k-SAT - paper by Ramamohan Paturi, Pavel Pudlák, Mike Saks, and Francis Zane".
  • Wednesday, Oct 17, 16:00, EV3.101
    Vašek Chvátal "Discussion on Chen-Chvátal conjecture".
  • Wednesday, Oct 10, 16:00, EV3.101
    Ehsan Chiniforooshan, "de Bruijn-Erdös theorem in Metric spaces".
    Vašek Chvátal "de Bruijn-Erdös theorem in Metric spaces".
  • Wednesday, Oct 3, 16:00, EV3.101
    Ehsan Chiniforooshan, "Random Branching and Random Formulas".
  • Wednesday, Sep 19, 16:00, EV3.101
    Azam Heydari, "Some Combinatorial Search Problems".
  • Wednesday, Sep 12, 16:00, EV3.101
    François Genest, "Van der Waerden type problems and MPI".
  • Thursday, June 21, 14:30, EV3.101
    François Genest, "How to code in MPI".
  • Wednesday, May 17, 14:00, EV3.101
    Tanbir Ahmed, "An implementation of DPLL".
    Vašek Chvátal, "Branching rules in DPLL".
    François Genest, "Brief discussion on MPI".
  • Wednesday, May 2, 14:00, EV3.101
    Discussion on George Orwell's "Politics and the English Language".
    François Genest, "Rewriting a proof of a theorem by André Bouchet".
    Discussion on the problem SAT.
  • Wednesday, April 25, 14:00, EV3.101
    Ararat Harutyunyan and Shahin Kamali, "Highly Irregular Graphs".
    Azam Heydari and Hiba Tabbara, "How to Write Mathematics (Continued...)".
  • Wednesday, April 18, 14:00, EV3.123
    Azam Heydari and Hiba Tabbara, "How to Write Mathematics (Continued...)".
  • Wednesday, April 11, 14:30, EV3.101
    Azam Heydari and Hiba Tabbara, "How to Write Mathematics".
  • Wednesday, April 4, 14:30, EV3.101
    Joel Krajden, Discussion on the Opterons.
  • Wednesday, March 21, 14:00, EV3.101
    Majid Karimi Behbahanim, "On finite geometries".
  • Wednesday, March 7, 15:30, EV3.101
    Azam Heydari, Geoffrey Exoo's lower bound on the Ramsey number R(5,5)
  • Friday, February 9, noon, EV2.260/2.238
    David Avis, "Estimating the number of vertices of a polyhedron" (departmental seminar)
  • Wednesday, February 7, 15:30, EV4.181
    Majid Karimi Behbahanim on the paper "Estimating Search Tree Size" by Philip Kilby, John Slaney, Sylvie Thiebaux, and Toby Walsh
  • Wednesday, January 17, 15:00 - 17:00, EV3.123
    Hiba Tabbara, "Algorithms for graph colouring"

    [2006]

  • Monday, December 4, 16:30, EV3.101
    Arash Zaryabi, On probabilistic methods in discrete mathematics
    (Continuation of the previous speech...)
  • Thursday, November 30, 16:00, EV3.101
    Arash Zaryabi, On probabilistic methods in discrete mathematics
  • Wednesday, November 29, 16:30, EV2.238
    Clement Lam, "Estimating the efficiency of backtrack programs" (departmental seminar)
  • Wednesday, November 15, 16:30, EV2.238
    François Genest, "Knuth sings the praises of dancing links" (departmental seminar)

[Back to LINKS] [Back to Top]
Publications:
  • Some new van der Waerden numbers and some van der Waerden-type numbers.
    Tanbir Ahmed. Integers, 9 (2009), A06, pp. 65-76. [Link]
  • Two new van der Waerden numbers: w(2; 3, 17) and w(2; 3, 18).
    Tanbir Ahmed. Integers, 10 (2010), A32, pp. 369-377. [Link]
  • An Implementation of the DPLL Algorithm.
    Tanbir Ahmed. M. Comp. Sci. Thesis, Concordia University. [PDF]
  • Another abstraction of the Erdös-Szekeres Happy End Theorem.
    Noga Alon, Ehsan Chiniforooshan, Vašek Chvátal, François Genest.
    The Electronic Journal of Combinatorics, 17 (2010), #N11 (6 pages) [Link]
  • Pursuit and evasion from a distance: algorithms and bounds.
    Anthony Bonato, Ehsan Chiniforooshan.
    Workshop on Analytic Algorithmics and Combinatorics (ANALCO'09), 2009. [PDF]
  • Cops and robbers from a distance.
    Anthony Bonato, Ehsan Chiniforooshan, Pawel Pralat.
    To appear in Theoretical Computer Science. [PDF]
  • Transversals in trees.
    Victor Campos, Vašek Chvátal, Luc Devroye, Perouz Taslakian.
    to appear in Journal of Graph Theory. [arXiv:0705.1806v1 [math.CO]]
  • A de Bruijn - Erdös theorem and metric spaces.
    Ehsan Chiniforooshan, Vašek Chvátal. [arXiv:0906.0123v1 [math.CO]]
  • Maximum values of Szeged index and edge-Szeged index of graphs.
    Ehsan Chiniforooshan, Baoyindureng Wu.
    Electronic Notes in Discrete Mathematics (European Conference on Combinatorics, Graph Theory and Applications), 34:405-409, 2009. [Link]
  • Antimatroids, betweenness, convexity.
    Vašek Chvátal. in: William Cook, László Lovász, Jens Vygen (Editors), Research Trends in Combinatorial Optimization, Springer, Berlin 2009, pp. 57 -- 64 [Preprint]
  • On Reichenbach's causal betweenness.
    Vašek Chvátal, Baoyindureng Wu.
    To appear in Erkenntnis. [arXiv:0902.1763v1 [math.CO]]
  • The Maximal Lyapunov Exponent of a Time Series.
    Mark Goldsmith. M. Comp. Sci. Thesis, Concordia University. [PDF]

[Back to LINKS] [Back to Top]
Library:

[Back to LINKS] [Back to Top]
Open Problems:
- Problems from the workshop on hybrid methods and branching rules in combinatorial optimization
- Colouring the queen graphs
- A conjecture in extremal combinatorics
- Open problems on perfect graphs (compiled by Maria Chudnovsky)
- Problems from the AIM Workshop on Perfect Graphs
- Problems from British Combinatorial Conferences edited by Peter Cameron
- Peter Cameron's collection of "old problems"
- The EGRES Collection
- Unsolved Problems Links from Mathsoft (formerly Steven Finch's collection)
- Past Open Problems Columns by Douglas B. West
- Graph Coloring Problems by Tommy R. Jensen and Bjarne Toft
- Joseph Culberson's Graph Coloring Page
- DIMACS Open Problems for Undergraduates (maintained by Robert Hochberg)
- Jeff Erickson's collection (mainly geometric)
- The Geometry Junkyard of David Eppstein
- Stephen Locke's dynamic update of Bondy & Murty's 50 unsolved problems
- Bill Martin's collection Some Open Problems in Algebraic Combinatorics
- Q.F. Stout's Open Problems and Conjectures (related to the domination number of graphs)
- Open Problems from the Workshop on Satisfiability held in Siena, 1996
- Survey of Problems, Questions, and Conjectures from the book "Combinatorial Optimization   Polyhedra and Efficiency" by Alexander Schrijver
- Unsolved Combinatorial Problems collected by Zsolt Tuza

[Back to LINKS] [Back to Top]
Conferences:
[SERIES]
  • The International Conferences on Theory and Applications of Satisfiability Testing (SAT)

    [FUTURE]
    [PAST]
    • [May 10 - 13, 2008, Boston, Massachusetts] OP08 (SIAM Conference on Optimization)
    • [October 9 - 11, 2007, Philadelphia, Pennsylvania] MI07 (SIAM Conference on Mathematics for Industry: Challenges and Frontiers)
    • [June 25-27, 2007, Cornell University] IPCO 2007 (Integer Programming & Combinatorial Optimization)
    • [June 17 - 22, 2007, Juan-les-pins, France] AofA 2007 (International Conference on Analysis of Algorithms)
    • [June 11-15, 2007, Kyoto, Japan] KyotoCGGT2007 (Kyoto International Conference on Computational Geometry and Graph Theory (in honor of the 60th birthdays of Jin Akiyama and Vasek Chvatal)
    • [May 28 - 31, 2007, Banff Conference Center] CANADAM 2007 (1st Canadian Discrete and Algorithmic Mathematics Conference)
    • [April 22-25, 2007, Spa, Belgium] INOC 2007 (International Network Optimization Conference)
    • [April 7-9, 2007, Hangzhou, China] ESCAPE 2007 (International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies)
    • [February 17-19, 2007, Costa Mesa, California] CSC07 (SIAM Workshop on Combinatorial Scientific Computing)
    • [February 12-18, 2007, Andalo (Trento), Italy] LION 2007 (Learning and Intelligent OptimizatioN)
    • [January 7-9, 2007, New Orleans, Louisiana] SODA 2007 (ACM-SIAM Symposium on Discrete Algorithms )
    • [January 6, 2007, New Orleans, Louisiana] ALENEX07 (Workshop on Algorithm Engineering and Experiments)
    • [September 18 - 22, 2006, Montreal] Hybrid methods and branching rules in combinatorial optimization

  • [Back to LINKS] [Back to Top]
    Journals:
    [A]
    - Acta Informatica
    - Algorithmica
    - Annals of Operations Research
    - Artificial Intelligence
    [C]
    - Canadian Journal of Mathematics
    - Chicago Journal of Theoretical Computer Science
    - Combinatorica
    - Combinatorics, Probability and Computing
    - Computational Complexity
    - Computational Geometry, Theory and Applications
    [D]
    - Discrete Applied Mathematics
    - Discrete Mathematics
    - Discrete Mathematics and Theoretical Computer Science
    - Discrete Optimization
    [E]
    - Electronic Colloquium on Computational Complexity
    - Electronic Notes on Discrete Mathematics
    - European Journal of Combinatorics
    - European Journal of Operational Research
    [G]
    - Graphs and Combinatorics
    [I]
    - Information and Computation
    - Information Processing Letters
    [J]
    - Journal of Algorithms
    - Journal of Combinatorial Optimization
    - Journal of Combinatorial Theory Series A
    - Journal of Combinatorial Theory Series B
    - Journal of Computer and System Sciences
    - Journal of Discrete Algorithms
    - Journal of Graph Algorithms and Applications
    - Journal of Graph Theory
    - Journal of The ACM
    - Journal on Satisfiability, Boolean Modeling and Computation
    [L]
    - Linear Algebra and its Applications
    [M]
    - Mathematical Programming
    - Mathematics of Operations Research
    [N]
    - Networks
    [O]
    - Operations Research
    - Operations Research Letters
    [S]
    - SIAM Journal on Applied Mathematics
    - SIAM Journal on Computing
    - SIAM Journal on Discrete Mathematics
    - SIAM Journal on Optimization
    [T]
    - Theoretical Computer Science
    - Transactions of the American Mathematical Society

    [Back to LINKS] [Back to Top]
    Combinatorics and Optimization People:
    [A]
    - Aharoni, Ron [Department of Mathematics, Technion, Israel]
    - Alon, Noga [School of mathematical Sciences, Tel Aviv University]
    - Applegate, David [AT&T Labs]
    - Avis, David M. [School of Computer Science, McGill University]
    [B]
    - Balas, Egon [Department of Mathematical Sciences, Carnegie Mellon University]
    - Brandstädt, Andreas [Institut für Informatik]
    - Bixby, Robert E. [Department of Computational and Applied Mathematics, Rice University]
    - Bockmayr, Alexander [Mathematics in Life Sciences, Freie Universität Berlin]
    - Bollobás, Bela [Mathematical Sciences, The University of Memphis]
    - Bondy, Adrian [Combinatoire & Optimisation, Université Pierre et Marie Curie]
    - Boros, Endre [Operations Research, Rutgers, The State University of New Jersey]
    - Bourjolly, Jean-Marie [Université du Québec à Montréal]
    [C]
    - Cameron, Kathie [Department of Mathematics, Wilfrid Laurier University]
    - Christofides, Nicos [Tanaka Business School, Imperial College, London]
    - Chudnovsky, Maria [Industrial Engineering and Operations Research, Columbia]
    - Chvátal, Vašek [Computer Science and Software Engineering, Concordia University]
    - Conforti, Michele [Operations Research group, University of Padova]
    - Cook, Stephen [Computer Science, University of Toronto]
    - Cook, William J. [School of Industrial and Systems Engineering, Georgia Tech.]
    - Corneil, Derek G. [Computer Science, University of Toronto]
    - Cornuejols, Gerard P. [Carnegie Mellon Tepper School of Business, CMU]
    - Culberson, Joseph (Joe) [Department of Computing Science, University of Alberta]
    - Cunningham, William H. [Combinatorics and Optimizaion, University of Waterloo]
    [D]
    - Dash, Sanjeeb [IBM Research - Theory of Computation]
    - Dechter, Rina [University of California Irvine]
    - Demaine, Erik D. [Theory of Computation Group, M.I.T.]
    - Demassey, Sophie [Discrete Constraints Group, École des Mines de Nantes, LINA]
    [E]
    - Eisenbrand, Friedrich [Department of Mathematics, Paderborn University]
    [F]
    - Figueiredo, Celina Miraglia Herrera de [Universidade Federal do Rio de Janeiro]
    - Franco, John [Department of Computer Science, University of Cincinnati]
    - Freuder, Eugene [Cork Constraint Computation Centre (4C), University College Cork]
    - Frieze, Alan [Department of Mathematical Sciences, Carnegie Mellon University]
    [G]
    - Gabow, Harold N. [Department of Mathematics, M.I.T.]
    - Gendreau, Michel [Université de Montréal]
    - Gerards, Bert [CWI]
    - Goemans, Michel X. [Department of Mathematics, M.I.T.]
    - Goldberg, Andrew V. [Microsoft Research - Theory Group]
    - Gomes, Carla P. [Computer Science, Cornell University]
    - Graham, Ronald L. [Computer Science and Engineering, University of California, San Diego]
    - Grötschel, Martin [Zuse Institute Berlin (ZIB)]
    [H]
    - Hayward, Ryan B. [Computer Science, University of Alberta]
    - Hertz, Alain [GERAD]
    - Hirsch, Edward A. [Laboratory of Mathematical Logic, Petersburg Department of Steklov Institute of Mathematics, Russian Academy of Sciences]
    - Hougardy, Stefan [Humboldt-Universität zu Berlin]
    [J]
    - Jaumard, Brigitte [CIISE, Concordia University]
    - Jensen, Tommy R. [Mathematics and Computer Science, University of Southern Denmark]
    - Johnson, David S. [AT&T Labs, Inc. - Research]
    [K]
    - Karamanov, Miroslav [Tepper School of Bussiness, Carnegie Mellon University]
    - Kézdy, André [University of Louisville]
    [L]
    - Lam, Clement [Computer Science and Software Engineering, Concordia University]
    - Larose, Benoit [Mathematics and Statistics, Concordia University]
    - Le Berre, Daniel [CRIL, l'Université d'Artois ]
    - Lenhart, William J. [Computer Science, Williams College]
    - Lenstra, Jan K. [Centrum voor Wiskunde en Informatica (CWI), Netherlands]
    - Li, Chu Min [Université de Picardie Jules Verne]
    - Linderoth, Jeff [Lehigh University]
    - Lodi, Andrea [Operations Research Group, Università degli Studi di Bologna]
    - Lovász, Lászlo [Eötvös Loránd University, Faculty of Science, Institute of Mathematics ]
    - Lubiw, Anna [Computer Science, University of Waterloo]
    - Lucchesi, Cláudio L. [Universidade Estadual de Campinas]
    - Lynce, Inês [Departamento de Engenharia Informática, INESC-ID Lisboa]
    [M]
    - Maffray, Frédéric [Leibniz Laboratory, IMAG Institute, Grenoble, France]
    - Maire, Frédéric [Queensland University of Technology]
    - Marques-Silva, Joao [University of Southampton ]
    - Milano, Michela [DEIS - Università di Bologna]
    - Miller, Mirka [Computer Science, University of Ballarat]
    - Mitchell, David G. [Computational Logic Lab, Simon Fraser University]
    [N]
    - Nemhauser, George L. [School of Industrial and Systems Engineering, Georgia Tech.]
    [O]
    - Ouyang, Ming [Department of Pharmacology, UMDNJ]
    [P]
    - Papadimitriou, Christos H. [Electrical Engineering and Computer Science, UC Berkeley]
    - Porto, Oscar [Pontifícia Universidade Católica do Rio de Janeiro]
    - Preissmann, Myriam [Department of Discrete Mathematics, IMAG Institute, Grenoble, France]
    - Pulleyblank, William R. [Center for Business Optimization, IBM Research]
    [R]
    - Reed, Bruce A. [School of Computer Science, McGill University]
    [S]
    - Sakallah, Karem A. [ACAL, University of Michigan]
    - Saks, Michael [Mathematics Department, Rutgers]
    - Sales, Cláudia L. [Laboratórios de PesquIsa em ComputAção]
    - Sbihi, Najiba [Département Génie Industriel, Ecole Mohammadia d'Ingenieurs, Maroc]
    - Schrijver, Alexander [Centrum voor Wiskunde en Informatica (CWI), Netherlands]
    - Sebö, András [Laboratoire Leibniz, IMAG,Département de Mathématiques Discrètes, France]
    - Seymour, Paul D. [Department of Mathematics, Princeton University]
    - Shepherd, F. Bruce [Mathematical and Algorithmic Sciences, Lucent Technologies, Bell Labs]
    - Simon, Laurent [Laboratoire de Recherche en Informatique, CNRS-Université Paris-Sud]
    - Spinrad, Jerry P. [Computer Science, Vanderbilt University]
    - Stewart, Lorna [Computer Science, University of Alberta]
    [T]
    - Thomas, Robin [School of Mathematics, Georgia Institute of Technology]
    - Toft, Bjarne [Mathematics and Computer Science, University of Southern Denmark]
    - Trotter, Leslie E. Jr. [School of Operations Research and Industrial Engineering, Cornell]
    - Truemper, Klaus [Computer Science, University of Texas at Dallas]
    - Tucker, Alan [Department of Applied Mathematics and Statistics, Stony Brook, SUNY]
    - Tuza, Zsolt [MTA SZTAKI, Hungarian Academyof Sciences]
    [W]
    - Walsh, Toby [School of CSE, University of New South Wales]

    [Back to LINKS] [Back to Top]
    Optimization Software / Libraries / Instances / Benchmarks:
    - AMPL (A Modeling Languagefor Mathematical Programming)
    - CSPLIB (a problem library for constraints)
    - CPLEX (An optimization software package)
    - GLPK (GNU Linear Programming Kit)
    - LINDO
    - LOLIB (a library of sample instances for the linear ordering problem)
    - Mathematica
    - MIPLIB (Mixed Integer Problem Library)
    - NEOS Server
    - PBLIB (The Pseudo Boolean Library)
    - QAPLIB (A Quadratic Assignment Problem Library)
    - QSopt Linear Programming Solver
    - SAT and CSP Benchmarks (by Ke Xu)
    - SAT Benchmarks (by Fadi Aloul)
    - SAT Competitions
    - SAT LIVE (Up-to-date links for the Satisfiability Problem)
    - SATLIB (The Satisfiability Library)
    - SBSAT
    - SCIP (Solving Constraint Integer Programs)
    - SoPlex
    - SteinLib (A collection of Steiner tree problems in graphs)
    - The Mathworks
    - TSP Homepage
    - TSPBIB Home Page
    - TSPLIB (Sample instances for the TSP Problem)
    - Vertex Enumeration [cdd and cddplus, lrs, PORTA, zerOne]
    - Xpress-MP

    [Back to LINKS] [Back to Top]
    Research Groups, Organizations and Sites:
    [A]
    - ACM (Association for Computing Machinery) [SIGACT]
    - ADONET (Algorithmic Discrete Optimization Network)
    - Alfréd Rényi Institute of Mathematics
    - AMS
    - AMS Math on the Web
    - AMS Mathematical Subject Classification (1991)
    - AMS Mathematical Subject Classification (2000)
    - AMS MathSciNet
    - AMS MR Lookup
    - AT&T Lab. Inc - Research
    [B]
    - Bell Labs - Mathematical Sciences Research Center
    - BME Számtud és Információelméleti Tsz
    - BRICS (Basic Research in Computer Science), Aarhus
    [C]
    - CACS (Canadian Association of Computer Science)
    - CAMO (Center for Advanced Modeling and Optimization)
    - Canada Research Chairs
    - Carnegie Mellon University - Algorithms, Combinatorics and Optimization (ACO)
    - Carnegie Mellon University - Doctoral Program in Operations Research
    - CFI (Canadian Foundation of Innovation)
    - CGANT Research Group
    - Charles University, Prague - Department of Applied Mathematics
    - CIPS (Canadian Information Processing Society)
    - CMS (Canadian Mathematical Society)
    - COGA (Combinatorial Optimization & Graph Algorithms)
    - Columbia University - Computational Optimization Research Center (CORC)
    - Columbia University - School of Industrial Engineering and Operations Research
    - Combinatorics, Geometry and Computation - European Graduate Program
    - Comics Multi-site Research Group
    - Conseil de la science et de la technologie du Québec
    - CORE - Center for Operations Research and Econometrics, Belgium
    - Cork Constraint Computation Centre (4C)
    - Cornell University - School of Operations Research and Industrial Engineering
    - Cornell University - CWI (Centrum voor Wiskunde en Informatica), Amsterdam
    - CORS (Canadian Operations Research Society)
    - CRA (Computing Research Assiciation)
    - CRIAQ (Consortium de recherche et d'innovation en aérospatiale au Québec)
    - CRIM (Centre de recherche informatique de Montréal)
    - CRM (Centre de recherches mathématiques, Université de Montréal)
    - CRT (Centre de recherche sur les transports)
    - CWI
    [D]
    - DIMACS (Center for Discrete Mathematics and Theoretical Computer Science)
    - DIMATIA (Discrete Mathematics Theoretical Computer Science And Applications)
    [E]
    - EGRES (Egerváry Research Group on Combinatorial Optimization)
    - Equipe Combinatoire, Université P. et M. Curie, Paris
    - EMS (European Mathematical Society)
    - ERCIM (European Research Consortium for Informatics and Mathematics)
    [F]
    - Forschungsinstitut für Diskrete Mathematik
    - FQRNT (Le Fonds québécois de la recherche sur la nature et les technologies)
    - Free University of Brussels, Graphs and Optimisation Group
    [G]
    - Geogia Tech. - School of Industrial and Systems Engineering
    - GERAD (Groupe d'études et de recherche en analyse des décisions)
    [I]
    - IASI-CNR Optimization Group
    - IBM Research - Algorithms and Theory
    - IBM Research - Theory of Computation
    - IEEE Computer Society
    - IMU (International Mathematical Union)
    - INESC-ID
    - INFORMS (Institute for Operations Research and the Management Sciences)
    - ISM (Institut des sciences mathématiques)
    [K]
    - Kyoto University - Ibaraki Laboratory
    - Kyoto University - Research Institute for Mathematical Sciences
    [L]
    - Laboratoire Cédric, Paris - Equipe Optimisation Combinatoire
    - Laboratoire Leibniz, Grenoble - Equipe Optimisation Combinatoire
    - Lancaster University, Optimisation Research Center
    - LMS (London Mathematical Society)
    - LSE (London School of Economics) Operations Research Group
    [M]
    - MAA Online (Mathematical Association of America)
    - MathWorld (formerly Eric Weisstein's World of Mathematics)
    - Max Planck Institut Informatik
    - Microsoft Research - Theory Group
    - MIT - Algorithms Group
    - MIT - Department of Mathematics
    - MIT - Operations Research Group
    - MITACS (Mathematics of Information Technology and Computer Science)
    - MPS (Mathematical programming Society)
    - MTA SZTAKI - Discrete Structures Research Group
    - MTA SZTAKI - Informatics Laboratory
    [N]
    - NSERC (the Natural Sciences and Engineering Research Council of Canada)
    [O]
    - Oxford University Computing Laboratory Constraints Research Group
    [P]
    - PIMS - Pacific Institute of Mathematical Sciences
    - Princeton University - Mathematics Department
    [R]
    - RUTCOR (Rutgers Center for Operations research)
    [S]
    - Simon Fraser University, Vancouver - School of Computing Science
    [T]
    - Technical University of Denmark - Operations Research Group
    - Technical University of Graz - Combinatorial Optimization Group
    - Toyohashi University of Technology - Discrete Optimization Laboratory
    [U]
    - University of Bologna - Operations Research Group
    - University of Braunschweig - Institute for mathematical Optimization
    - University of British Columbia - Center for Operations Excellence
    - University of Cologne - Institut für Informatik
    - University of University of Darmstadt - Discrete Optimization Group
    - University of Dortmund - Computer Science
    - University of Dortmund - Discrete Optimization Group
    - University of Dresden - Cutting and Packing Group
    - University of Heidelberg - Discrete Optimization Group
    - University of Klagenfurt - Operations Research Group
    - University of Magdeburg - Institute for Mathematical Optimization
    - University of Modena and Reggio Emilia - Operations Research Group
    - University of Montreal - Center for Research on Transportation
    - University of Ottawa - IPCOS Lab
    - University of Pisa - Operations Research Group
    - University of Rome - Combinatorial Optimization Group
    - University of Southampton - Operations Research
    - University of Texas at Dallas - Deptartment of Computer Science
    - University of Tokyo - School of Engineering
    - University of Waterloo - Deptartment of Combinatorics and Optimization
    [V]
    - Virginia Tech. - Department of Industrial and Systems Engineering
    [W]
    - Warwick Business School - Operational Research and Information Systems Group
    [Z]
    - ZAIK (Zentrum für Angewandte Informatik Köln), Arbeitsgruppe Faigle/Schrader
    - ZIB (Zuse Institute Berlin)

    [Back to LINKS] [Back to Top]
    Pages providing pointers
    - Analysis of algorithms - maintained by Philippe Flajolet and Helmut Prodinger
    - Bill Chen's Combinatorics Net
    - Bookmarks for Edward A. Hirsch
    - BUBL LINK Catalogue of selected Internet resources
    - Godfried Toussaint's links
    - Hemanshu Kaul's favorite links
    - INFORMS OR/MS Resource Collection
    - Jean-Paul Davalan's Jeux et Mathématiques
    - Jeffrey O. Shallit's links to CS and math-related sites
    - Kartik Krishnan's Web Page
    - Kaisa Miettinen's Links Connected to Optimization, Operations Research and Others
    - Luc Devroye's Computer Science Links
    - Operations Research Links
    - Optimization Software Guide
    - Robert Fourer's Linear Programming FAQ
    - Stephen Locke's Graph Theory Page
    - Thomas Emden-Weinert's Graphs
    - Timothy Gowers's Maths Links
    - Tom Cavalier's Optimization Links
    - Volker Heun's Bookmarks

    [Back to LINKS] [Back to Top]