default search action
Discrete Optimization, Volume 8
Volume 8, Number 1, February 2011
- Michael R. Fellows
, Fedor V. Fomin
Special Issue on Parameterized Complexity of Discrete Optimization. 1 - Michael R. Fellows
Graph-based data clustering with overlaps. 2-17 - Peter Damaschke:
Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover. 18-24 - Dániel Marx
Stable assignment with couples: Parameterized complexity and local search. 25-40 - Faisal N. Abu-Khzam, Henning Fernau
Charge and reduce: A fixed-parameter algorithm for String-to-String Correction. 41-49 - Sylvain Guillemot:
Parameterized complexity and approximability of the Longest Compatible Sequence problem. 50-60 - Sylvain Guillemot:
FPT algorithms for path-transversal and cycle-transversal problems. 61-71 - Petr A. Golovach
Paths of bounded length and their cuts: Parameterized complexity and algorithms. 72-86 - Oren Ben-Zwi, Danny Hermelin
Treewidth governs the complexity of target set selection. 87-96 - Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
On the directed Full Degree Spanning Tree problem. 97-109 - Neeldhara Misra, Venkatesh Raman, Saket Saurabh:
Lower bounds on kernelization. 110-128 - Michael Lampis, Georgia Kaouri, Valia Mitsou:
On the algorithmic effectiveness of digraph decompositions and complexity measures. 129-138 - Stefan Szeider
The parameterized complexity of k-flip local search for SAT and MAX SAT. 139-145
Volume 8, Number 2, May 2011
- Andrew Gilpin, Tuomas Sandholm:
Information-theoretic approaches to branching in search. 147-159 - Alexander G. Nikolaev, Sheldon H. Jacobson
Using Markov chains to analyze the effectiveness of local search algorithms. 160-173 - Enrico Malaguti, Michele Monaci
An exact approach for the Vertex Coloring Problem. 174-190 - Ruonan Zhang, Santosh N. Kabadi, Abraham P. Punnen:
The minimum spanning tree problem with conflict constraints and its variations. 191-205 - Jácint Szabó:
Upgrading edge-disjoint paths in a ring. 206-214 - Marius Posta, Jacques A. Ferland, Philippe Michelon
Generalized resolution search. 215-228 - Ricardo Fukasawa
Strengthening lattice-free cuts using non-negativity. 229-245 - Luce Brotcorne, F. Cirinei, Patrice Marcotte, Gilles Savard:
An exact algorithm for the network pricing problem. 246-258 - Bo Zeng, Jean-Philippe P. Richard
A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Strong valid inequalities by sequence-independent lifting. 259-276 - Bo Zeng, Jean-Philippe P. Richard
A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Facet-defining inequalities by sequential lifting. 277-301 - Nili Guttmann-Beck, Refael Hassin:
On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph. 302-314 - Alessandro Aloisio
Cutting stock with no three parts per pattern: Work-in-process and pattern minimization. 315-332 - Leah Epstein
Online variable-sized bin packing with conflicts. 333-343 - Mourad Baïou, Francisco Barahona:
On the linear relaxation of the p-median problem. 344-375
- Olawale Titiloye
Quantum annealing of the graph coloring problem. 376-384 - Dinakar Gade, Simge Küçükyavuz:
A Note on "Lot-sizing with fixed charges on stocks: The convex hull". 385-392
Volume 8, Number 3, August 2011
- Géraldine Heilporn
Valid inequalities and branch-and-cut for the clique pricing problem. 393-410 - Eranda Çela
The Wiener maximum quadratic assignment problem. 411-416 - Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth:
New bounds on the average distance from the Fermat-Weber center of a planar convex body. 417-427 - Hiroshi Hirai, Shungo Koichi
On duality and fractionality of multicommodity flows in directed networks. 428-445 - Günes Erdogan
Two classes of Quadratic Assignment Problems that are solvable as Linear Assignment Problems. 446-451 - Yair Caro, Michael A. Henning
A Greedy Partition Lemma for directed domination. 452-458 - Fredrik Kuivinen:
On the complexity of submodular function minimisation on diamonds. 459-477 - Tim Januschowski, Marc E. Pfetsch
The maximum k-colorable subgraph problem and orbitopes. 478-494 - Teresa W. Haynes, Michael A. Henning
A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free. 495-501 - Sivan Altinakar, Gilles Caporossi, Alain Hertz:
On compact k-edge-colorings: A polynomial time reduction from linear to cyclic. 502-512
Volume 8, Number 4, November 2011
- Kangbok Lee
Coordination mechanisms with hybrid local policies. 513-524 - Sylvia C. Boyd, Robert Carr:
Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices. 525-539 - Diego Delle Donne
A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem. 540-554 - Dror Rawitz, Shimon Shahar:
Partial multicovering and the d-consecutive ones property. 555-567 - Joachim Kneis, Alexander Langer, Peter Rossmanith:
Courcelle's theorem - A game-theoretic approach. 568-594 - Volker Kaibel, Matthias Peinhardt, Marc E. Pfetsch
Orbitopal fixing. 595-610
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-14 22:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: