default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 354
Volume 354, 2024
- Claudio Gentile, Gaia Nicosia, Andrea Pacifici, Giuseppe Stecca, Paolo Ventura:
Preface: 18th Cologne-Twente Workshop on graphs and combinatorial optimization (CTW 2020). 1-2 - Eranda Çela
, Vladimir G. Deineko, Gerhard J. Woeginger:
Travelling salesman paths on Demidenko matrices. 3-14 - Janusz Dybizbanski, Hanna Furmanczyk, Vahan Mkrtchyan:
Gap one bounds for the equitable chromatic number of block graphs. 15-28 - Andrei Gagarin, William L. Kocay:
Embedding K3,3 and K5 on the double torus. 29-47 - Sara Mattia:
Reformulations and complexity of the clique interdiction problem by graph mapping. 48-57 - Jan Boeckmann, Clemens Thielen:
A (B+1)-approximation for network flow interdiction with unit costs. 58-71 - Elias John Thomas, S. V. Ullas Chandran, James Tuite, Gabriele Di Stefano:
On monophonic position sets in graphs. 72-82 - Germano Abud, Jorge Alencar, Carlile Lavor, Leo Liberti, Antonio Mucherino:
An impossible combinatorial counting method in distance geometry. 83-93 - Walid Ben-Ameur, Natalia Kushik, Alessandro Maddaloni, José Neto, Dimitri Watel:
The no-meet matroid. 94-107 - Subhankar Ghosal, Sasthi C. Ghosh:
Expected polynomial-time randomized algorithm for graph coloring problem. 108-121 - Guowei Dai, Longkun Guo, Gregory Z. Gutin, Xiaoyan Zhang, Zan-Bo Zhang:
Convergence and correctness of belief propagation for weighted min-max flow. 122-130 - Piotr Wojciechowski, K. Subramani:
Proving the infeasibility of Horn formulas through read-once resolution. 131-145 - Josep Díaz, Öznur Yasar Diner, Maria J. Serna, Oriol Serra:
The multicolored graph realization problem. 146-159 - Nili Guttmann-Beck, Michal Stern:
Decomposing the feasibility of Clustered Spanning Tree by Paths. 160-180 - Massimiliano Caramia, Emanuele Pizzari:
Novel bilevel formulations for waste management. 181-198 - Manuel Aprile, Michele Conforti, Samuel Fiorini, Yuri Faenza, Tony Huynh, Marco Macchia:
Slack matrices, k-products, and 2-level polytopes. 199-213 - K. S. Ajish Kumar, Birenjith Sasidharan, K. S. Sudeep:
On oriented diameter of (n,k)-star graphs. 214-228 - Xujin Chen, Xiaodong Hu, Chenhao Wang, Xiaoying Wu, Mengqi Zhang:
Algorithms for maximum social welfare of online random trading. 229-240 - Gruia Calinescu, Xiaolang Wang:
A (1/2+1/60) - Approximation algorithm for Maximum Weight Series-Parallel Subgraph. 241-261 - Zijian Xu, Vorapong Suppakitpaisarn:
On the size of minimal separators for treedepth decomposition. 262-270 - Sizhong Zhou:
Remarks on restricted fractional (g,f)-factors in graphs. 271-278 - Gerold Jäger, Marcel Turkensteen:
Assessing the effect of multiple cost changes using reverse set tolerances. 279-300 - Juhi Chaudhary, Dinabandhu Pradhan:
Roman {3}-domination in graphs: Complexity and algorithms. 301-325
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-05-19 21:09 CEST 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:
