default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 544
Volume 544, August 2014
- Kun-Mao Chao
, Tsan-sheng Hsu, D. T. Lee:
Algorithms and Computation (ISAAC 2012). 1-2
- Katarzyna E. Paluch:
Popular and clan-popular b-matchings. 3-13 - Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A 4.31-approximation for the geometric unique coverage problem on unit disks. 14-31 - Fabrizio Frati, Joachim Gudmundsson, Emo Welzl:
On the number of upward planar orientations of maximal planar graphs. 32-59 - Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient counting of square substrings in a tree. 60-73 - Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis:
Abstract flows over time: A first step towards solving dynamic packing problems. 74-83 - Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou:
Reconfiguration of list L(2,1)-labelings in a graph. 84-97
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-01-10 18:21 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:
