default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 26
Volume 26, May 2014
- Dacheng Xu
, Jianxi Fan:
On the metric dimension of HDN. 1-6 - Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei:
Subset feedback vertex sets in chordal graphs. 7-15 - Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
Gathering six oblivious robots on anonymous symmetric rings. 16-27 - Vadim E. Levit, David Tankus:
On relating edges in graphs without cycles of length 4. 28-33 - Gerth Stølting Brodal, Mark Greve, Vineet Pandey, Srinivasa Rao Satti:
Integer representations towards efficient counting in the bit probe model. 34-44 - Nicholas Korpelainen, Vadim V. Lozin, Christopher Purcell:
Dominating induced matchings in graphs without a skew star. 45-55 - Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Ioannis Milis:
Bounded max-colorings of graphs. 56-68 - Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer:
Irreversible conversion processes with deadlines. 69-76 - Vincent Vajnovszki:
An efficient Gray code algorithm for generating all permutations with a given major index. 77-88 - Daniel Berend, Shahar Golan:
Counting solutions to CSP using generating polynomials. 89-97 - Yingjie Wu, Lei Wang, Daxin Zhu, Xiaodong Wang:
An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints. 98-105
- Wojciech Fraczak, Loukas Georgiadis, Andrew Miller, Robert Endre Tarjan:
Corrections to "Finding dominators via disjoint set union" [J. Discrete Algorithms 23 (2013) 2-20]. 106-110
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-06-29 20:36 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:
