Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 246
Volume 246, September 2018
- Zsuzsanna Lipták
, W. F. Smyth:
Preface. 1 - Reuven Bar-Yehuda, Gilad Kutiel, Dror Rawitz:
1.5-approximation algorithm for the 2-Convex Recoloring problem. 2-11 - Joan Boyar, Christian Kudahl:
Adding isolated vertices makes some greedy online algorithms optimal. 12-21 - Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi:
Efficient enumeration of graph orientations with sources. 22-37 - Eduard Eiben, Robert Ganian, Juho Lauri:
On the complexity of rainbow coloring problems. 38-48 - Guillaume Fertin, Irena Rusu, Stéphane Vialette:
The S-labeling problem: An algorithmic tour. 49-61 - Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang:
Solving the tree containment problem in linear time for nearly stable phylogenetic networks. 62-79 - Dusan Knop, Tomás Masarík:
Computational complexity of distance edge labeling. 80-98
- Frédéric Giroire, Stephane Perennes, Issam Tahiri:
Grid spanners with low forwarding index for energy efficient networks. 99-107 - Mujiangshan Wang, Yuqing Lin, Shiying Wang:
The 1-good-neighbor connectivity and diagnosability of Cayley graphs generated by complete graphs. 108-118
- Francine Blanchet-Sadri, S. Osborne:
Computing longest common extensions in partial words. 119-139 - Guillaume Fertin, Loïc Jankowiak, Géraldine Jean:
Prefix and suffix reversals on strings. 140-153
a service of 
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-04-25 05:29 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:
