Original submission page can be found here.
LAGOS2013 Accepted Posters
Hamiltonicity on the Fibonacci and the Lucas Cubes.
Optimum modular check digit systems.
A new algorithm for the Discretizing Vertex Order Problem.
Complexity of greedy edge-colouring.
A heuristic algorithm for binary Mixed-Integer Nonlinear Programming.
Tight Scheduling Constraints for the Integrated Lot Sizing and Scheduling Problem.
Solving the Operating Room Scheduling Problem using Mathematical Programming.
LAGOS 2013 Accepted Papers
Accepted Papers: 60.
Submitted Papers: 131.
Matchings in Graphs of Odd Regularity and Girth
b-chromatic index of graphs
Clique cycle transversals in distance hereditary graphs (extended abstract)
More on connector families
Graphs with Dilworth Number Two are Pairwise Compatibility Graphs
The generalized split probe proble
Special asteroidal quadruple on directed path graph non rooted path graph.
Almost Empty Monochromatic Triangles in Planar Point Sets
A Branch-and-price Algorithm for the Multi-Vehicle Covering Tour Problem
Hull number: P5-free graphs and reduction rules
Obstructions to chordal circular-arc graphs of small independence number
A New Formulation and Computational Results for the Simple Cycle Problem
A 'Hot Potato' Gray Code for Permutations
Small degree vertices in minimal bricks
Small degeneracy of antiferromagnetic triangulations
The convexity of induced paths of order three
On minimal non [h,2,1] graphs
Null and non--rainbow colorings of maximal planar graphs
Geometric variants of Hall's Theorem through Sperner's Lemma
The transversal numbers of linear systems with given $2$-packing numbers.
On the Monotonicity of Process Number
Robust Optimization for the Connected Facility Location Problem
Searching for perfection on hypergraphs
The $\omega\psi$-perfection of graphs
Empty triangles in complete topological graphs
Polyhedra associated with identifying codes
Balanced 6-holes in linearly separable bichromatic point sets
On k-critical P5-free graphs
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs
Models and Algorithms for Carsharing Systems and Related Problems
On Minimal and Minimum Hull Sets
On Schur's conjecture
{k}-domination for chordal graphs and related graph classes
Algorithms to Approximately Count and Sample Conforming Colorings of Graphs
Polyhedral studies on the convex recoloring problem
On the representatives k-fold coloring polytope
Linear time computation of the maximal sums of insertions into all positions of a sequence
Arc-based integer programming formulations for three variants of proportional symbol maps
Recoloring bounded treewidth graphs
On the packing chromatic number of hypercubes
The 2-dominating set polytope of cycles and related graph classes
A new infinite family of minimal non-orientable matroids of rank $3$ with $3n$ elements
An exact DSatur-based algorithm for the Equitable Coloring Problem
Introducing subclasses of basic chordal graphs
Too many triangles
Snarks and Flow-Critical Graphs
Bipartite Graphs, Hamiltonicity and $ \mathbb{Z}$ graphs
Approximating connected facility location with buy-at-bulk edge costs via random sampling
Pruned discrete random samples: extended abstract
A note on the disjunctive index of joined a-perfect graphs
Fulkerson's Conjecture and Loupekine snarks
Lovász-Schrijver SDP-operator and a superclass of near-perfect graphs
Diffuse Reflections in Simple Polygons
The Wide Partition Conjecture and the Atom Problem in Discrete Tomography
Greedy Pancake Flipping
Edge Intersection Graphs of L-Shaped Paths in Grids
Polynomial time algorithm for the Radon number of grids in the geodetic convexity
On the first Chvátal closure of the set covering polyhedron related to circulant matrices
Extremal results for odd cycles in sparse pseudorandom graphs
An approximate blow-up lemma for sparse pseudorandom graphs