Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 16
Volume 16, October 2012
- Costas S. Iliopoulos, William F. Smyth:
Editorial. 1
- Zahed Rahmati
, Alireza Zarei:
Kinetic Euclidean minimum spanning tree in the plane. 2-11 - Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller:
A new view on Rural Postman based on Eulerian Extension and Matching. 12-33 - Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta, Ignaz Rutter:
Hamiltonian orthogeodesic alternating paths. 34-52 - Júlio Araújo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, Remigiusz Modrzejewski:
Weighted improper colouring. 53-66 - Markus Chimani, Petra Mutzel, Bernd Zey:
Improved Steiner tree algorithms for bounded treewidth. 67-78 - Sebastian Böcker:
A golden ratio parameterized algorithm for Cluster Editing. 79-89 - Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, Md. Saidur Rahman:
Acyclic colorings of graph subdivisions revisited. 90-103
- Anne Condon, Chris Thachuk:
Efficient codon optimization with motif engineering. 104-112 - Francine Blanchet-Sadri, Travis Mandel, Gautam Sisodia:
Periods in partial words: An algorithm. 113-128 - Richard Beal, Donald A. Adjeroh:
Variations of the parameterized longest previous factor. 129-150 - Richard Beal, Donald A. Adjeroh:
p-Suffix sorting as arithmetic coding. 151-169
- Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk:
Strengthening hash families and compressive sensing. 170-186 - Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
The weak-heap data structure: Variants and applications. 187-205 - Amr Elmasry, Arash Farzan, John Iacono:
A priority queue with the time-finger property. 206-212
- A. N. Trahtman:
An algorithm for road coloring. 213-223 - Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong:
The knapsack problem with neighbour constraints. 224-235 - Frank Ruskey, Jennifer Woodcock, Yuji Yamauchi:
Counting and computing the Rand and block distances of pairs of set partitions. 236-248 - Vadlamudi Ch. Venkaiah, T. Aaron Gulliver:
Quasi-cyclic codes over F13 and enumeration of defining polynomials. 249-257 - Alejandro Erickson, Mark Schurch:
Monomer-dimer tatami tilings of square regions. 258-269 - Khalegh Mamakani, Wendy J. Myrvold, Frank Ruskey:
Generating simple convex Venn diagrams. 270-286 - Stephane Durocher, Pak Ching Li, Debajyoti Mondal, Frank Ruskey, Aaron Williams:
Cool-lex order and k-ary Catalan structures. 287-307
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-22 20:02 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:
