default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 68
Volume 68, February 2018
- Jan Kratochvíl
, Zsuzsanna Lipták:
Preface. 1-2
- Stepan Artamonov, Maxim A. Babenko:
A fast scaling algorithm for the weighted triangle-free 2-matching problem. 3-23 - Carla Binucci, Emilio Di Giacomo, Md. Iqbal Hossain, Giuseppe Liotta:
1-page and 2-page drawings with bounded number of crossings per edge. 24-37 - Ilkyoo Choi, Jan Ekstein, Premysl Holub, Bernard Lidický:
3-coloring triangle-free planar graphs with a precolored 9-cycle. 38-65 - Daniel Freund, Matthias Poloczek, Daniel Reichman:
Contagious sets in dense graphs. 66-78 - Nils M. Kriege, Florian Kurpicz, Petra Mutzel:
On maximum common subgraph problems in series-parallel graphs. 79-95
- Fan Chung, Olivia Simpson:
Computing heat kernel pagerank and a local clustering algorithm. 96-119 - Saad I. El-Zanati, Uthoomporn Jongthawonwuth, Heather Jordon, Charles Vanden Eynden:
Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph G where G is the union of two disjoint cycles. 120-131 - Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumeration and maximum number of minimal connected vertex covers in graphs. 132-147 - Klaus Jansen, Stefan Erich Julius Kraft:
A faster FPTAS for the Unbounded Knapsack Problem. 148-174 - Meirav Zehavi:
The k-leaf spanning tree problem admits a klam value of 39. 175-203
- Francine Blanchet-Sadri, Michelle Cordier, Rachel Kirsch:
Border correlations, lattices, and the subgraph component polynomial. 204-222 - Francine Blanchet-Sadri, Justin Lazarow, Jordan Nikkel, J. D. Quigley, Xufan Zhang:
Computing primitively-rooted squares and runs in partial words. 223-241 - Béla Bollobás, Shoham Letzter:
Longest common extension. 242-248 - Mikhail Rubinchik, Arseny M. Shur:
EERTREE: An efficient data structure for processing palindromes in strings. 249-265
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-12-09 23:25 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:
