default search action
Discrete Applied Mathematics, Volume 303
Volume 303, November 2021
17th Cologne–Twente Workshop on Graphs and Combinatorial Optimization (CTW 2019)
- Bodo Manthey, Johann L. Hurink:
Preface: 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2019). 1 - Winfried Hochstättler, Johann L. Hurink, Bodo Manthey, Daniël Paulusma, Britta Peis, Georg Still:
In Memoriam Walter Kern. 2-3 - Stephan Dominique Andres
:
Greedy versus recursive greedy: Uncorrelated heuristics for the binary paint shop problem. 4-7 - Márcia R. Cerioli, Taísa Martins
Short proofs on the structure of general partition, equistable and triangle graphs. 8-13 - Sven de Vries, Bernd Perscheid:
A smaller extended formulation for the odd cycle inequalities of the stable set polytope. 14-21 - Julien Dewez, Nicolas Gillis, François Glineur:
A geometric lower bound on the extension complexity of polytopes based on the f-vector. 22-38 - Diego Delle Donne
A branch-and-price algorithm for the Minimum Sum Coloring Problem. 39-56 - Jorin Dornemann
Cross-series-parallel digraphs. 57-65 - M. R. Emamy-K, Rafael A. Arce-Nazario
On the cut number problem for the 4, and 5-cubes. 66-75 - Andrea Frosini
On null 3-hypergraphs. 76-85 - Roghayeh Hafezieh, Mohammad Ali Hosseinzadeh
On cut vertices and eigenvalues of character graphs of solvable groups. 86-93 - Thomas Lachmann
A linear time algorithm for the robust recoverable selection problem. 94-107 - Bartosz Makuracki
Coefficients of non-negative quasi-Cartan matrices, their symmetrizers and Gram matrices. 108-121 - Samuel Mohr
A construction of uniquely colourable graphs with equal colour class sizes. 122-126 - Tim Ophelders, Roel Lambers
A note on equitable Hamiltonian cycles. 127-136 - Phillippe Samer
Fixed cardinality stable sets. 137-148 - Florian Thaeter
Hardness of k-anonymous microaggregation. 149-158
- Takeaki Uno, Andrea Marino:
Preface: WEPA 2018. 160 - Tzvi Alon
A faster FPTAS for counting two-rowed contingency tables. 161-170 - Naveed Ahmed Azam
A method for enumerating pairwise compatibility graphs with a given number of vertices. 171-185 - Sarah Blind
Locally definable vertex set properties are efficiently enumerable. 186-202 - Florent Capelli, Yann Strozecki
Enumerating models of DNF faster: Breaking the dependency on the formula size. 203-215 - Nofar Carmeli
Efficiently enumerating minimal triangulations. 216-236 - Alessio Conte
Maximal strongly connected cliques in directed graphs: Algorithms and bounds. 237-252 - Danny Hermelin, George Manoussakis:
Efficient enumeration of maximal induced bicliques. 253-261 - Christian Komusiewicz
Enumerating connected induced subgraphs: Improved delay and experimental comparison. 262-282 - Kazuhiro Kurita
Efficient enumeration of dominating sets for sparse graphs. 283-295 - On-Hei Solomon Lo
Compact cactus representations of all non-trivial min-cuts. 296-304 - Katsuhisa Yamanaka
Algorithmic enumeration of surrounding polygons. 305-313
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 2024-11-15 19: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: