The union-closed sets conjecture almost holds for almost all random bipartite graphs Henning Bruhn and Oliver Schaudt Abstract Frankl’s union-closed sets conjecture states that in every finite unionclosed family of set

Source URL: www.zaik.uni-koeln.de

• Graph theory
• Mathematics
• Graph coloring
• Combinatorial optimization
• Matching
• NP-complete problems
• Bipartite graph
• Union-closed sets conjecture
• Maximal independent set
• Triangle-free graph

February 3, 2009 COM S 6810 Theory of Computing Lecture 5: Polynomial Hierarchy Instructor: Rafael Pass

Source URL: www.cs.cornell.edu

• Computational complexity theory
• Complexity classes
• Theory of computation
• Polynomial hierarchy
• P versus NP problem
• IP
• True quantified Boolean formula
• NP
• PP
• Oracle machine
• PSPACE-complete
• Polynomial-time reduction

Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles Oliver Schaudt Institut f¨ ur Informatik, Universit¨at zu K¨oln, K¨oln, Germany

Source URL: www.zaik.uni-koeln.de

• NP-complete problems
• Graph
• Graph theory
• Matching
• Cycle
• Hamiltonian path
• Spanning tree

Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages Maciej Besta Torsten Hoefler

Source URL: htor.inf.ethz.ch

• Graph theory
• Mathematics
• Computing
• Concurrency control
• Transaction processing
• NP-complete problems
• Computer memory
• Transactional memory
• Vertex
• Breadth-first search
• Graph coloring
• Transactional Synchronization Extensions

Decision-aid Methodology for the School Bus Routing and Scheduling Problem Michela Spada, ROSO-IMA-EPFL Michel Bierlaire, ROSO-IMA-EPFL Thomas Liebling, ROSO-IMA-EPFL

Source URL: www.strc.ch

• Operations research
• Combinatorial optimization
• Mathematical optimization
• NP-complete problems
• Travelling salesman problem
• Integer programming
• School bus
• Branch and bound
• Bus
• Heuristic
• Lagrangian relaxation

Local Properties of Geometric Graphs Jean Cardinal∗ S´ebastien Collette† Stefan Langerman‡ § relation between any pair of sites and the number of items in its neighborhood.

Source URL: www.ulb.ac.be

• Graph theory
• Bipartite graphs
• Geometric spanner
• Shortest path problem
• Planar graph
• Tree
• Delaunay triangulation
• NP-complete problems
• Planar separator theorem
• Trapezoid graph

The Vehicle Routing Problem with Discrete Split Delivery and Time Windows Ilaria Vacca Matteo Salani STRC 2009

Source URL: www.strc.ch

• Operations research
• Mathematical optimization
• Numerical analysis
• Mathematics
• NP-complete problems
• Vehicle routing problem
• Dynamic programming
• Column generation
• Optimization problem
• XTR
• DantzigWolfe decomposition

Fine-Grained Complexity and Algorithm Design Boot Camp Recent Advances in FPT and Exact Algorithms for NP-Complete Problems Dániel Marx Institute for Computer Science and Control,

Source URL: www.cs.bme.hu

Almost partitioning any 3-edge-coloured Kn,n into 5 monochromatic cycles Richard Lang, Oliver Schaudt, Maya Stein∗ 30th SeptemberAbstract

Source URL: www.zaik.uni-koeln.de

• NP-complete problems
• Combinatorial optimization
• Graph coloring
• Matching
• Cycle
• Bipartite graph
• Graph

WeilSchaudt_DeltaChi_GaC.dvi

Source URL: www.zaik.uni-koeln.de

• Graph theory
• Graph coloring
• NP-complete problems
• Graph operations
• Perfect graph theorem
• Line graph
• Perfect graph
• Clique
• Bipartite graph
• Triangle-free graph
• Strong perfect graph theorem
• Graph minor