Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 532
Volume 532, May 2014
- Pinyan Lu
, Jack Snoeyink:
Frontiers in algorithmics. 1
- Joan Boyar, Kim S. Larsen, Abyayananda Maiti:
A comparison of performance measures via online search. 2-13 - Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Fast relative Lempel-Ziv self-index for similar sequences. 14-30 - Chenglin Fan, Jun Luo, Wencheng Wang, Binhai Zhu:
Voronoi diagram with visual restriction. 31-39 - Bryan Dawei He:
A simple optimal binary representation of mosaic floorplans and Baxter permutations. 40-50 - Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai, Yue-Li Wang:
On the complexity of the black-and-white coloring problem on some classes of perfect graphs. 51-63 - Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou:
Bandwidth consecutive multicolorings of graphs. 64-72 - Xuehou Tan, Bo Jiang:
Minimization of the maximum distance between the two guards patrolling a polygonal region. 73-79 - Jiun-Jie Wang, Xin He:
Succinct strictly convex greedy drawing of 3-connected plane graphs. 80-90
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-05-06 20:14 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:
