default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 31
Volume 31, March 2015
- Thierry Lecroq
, Laurent Mouchard:
Editorial. 1 - Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Andreas Hofmeier:
On the hardness of maximum rank aggregation problems. 2-13 - Clément Charpentier, Éric Sopena:
The incidence game chromatic number of (a, d)-decomposable graphs. 14-25 - Elie de Panafieu:
Phase transition of random non-uniform hypergraphs. 26-39 - Hayk Grigoryan, Hovhannes A. Harutyunyan:
The shortest path problem in the Knödel graph. 40-47 - Florent Foucaud:
Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes. 48-68 - Toru Hasunuma:
Structural properties of subdivided-line graphs. 69-86 - Gerold Jäger, Florian Arnold:
SAT and IP based algorithms for magic labeling including a complete search for total magic labelings. 87-103 - Vadim V. Lozin, Jérôme Monnot, Bernard Ries:
On the maximum independent set problem in subclasses of subcubic graphs. 104-112 - Hongliang Lu, Yuqing Lin:
Maximum spectral radius of graphs with given connectivity, minimum degree and independence number. 113-119 - Neerja Mhaskar, Michael Soltys:
String shuffle: Circuits and graphs. 120-128 - Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi:
Partial Information Network Queries. 129-145
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-08 20:19 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:
