default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 806
Volume 806, February 2020
- Maxime Crochemore
, Luís M. S. Russo:
Cartesian and Lyndon trees. 1-9 - Jarkko Peltomäki, Markus A. Whiteland:
More on the dynamics of the symbolic square root map. 10-27 - Jean Néraud, Carla Selmi:
Embedding a θ-invariant code into a complete one. 28-41 - Alejandro Estrada-Moreno:
On the k-partition dimension of graphs. 42-52 - Linda Eroh, Cong X. Kang, Eunjeong Yi:
The connected metric dimension at a vertex of a graph. 53-69 - Tong Qin, Osamu Watanabe:
An improvement of the algorithm of Hertli for the unique 3SAT problem. 70-80 - Takahiro Fujita, Kohei Hatano, Eiji Takimoto:
Boosting over non-deterministic ZDDs. 81-89 - Robin Lamarche-Perrin:
An information-theoretic framework for the lossy compression of link streams. 90-115 - Laurent Bulteau, Stéphane Vialette:
Recognizing binary shuffle squares is NP-hard. 116-132 - Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Alternative parameterizations of Metric Dimension. 133-143 - Liliana Alcón, Marisa Gutierrez, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo:
Neighbor-locating colorings in graphs. 144-155 - Anni Hakanen, Ville Junnila, Tero Laihonen:
The solid-metric dimension. 156-170 - Eunjeong Yi:
On the broadcast domination number of permutation graphs. 171-183 - Julien Baste, Binh-Minh Bui-Xuan, Antoine Roux:
Temporal matching. 184-196 - Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche:
Temporal graph classes: A view through temporal separators. 197-218 - Annalisa De Bonis, Ugo Vaccaro:
A new kind of selectors and their applications to conflict resolution in wireless multichannels networks. 219-235 - Evangelos Bampas, Jurek Czyzowicz, David Ilcinkas, Ralf Klasing:
Beachcombing on strips and islands. 236-255 - Jie You, Feng Shi, Jianxin Wang, Qilong Feng:
Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition. 256-270 - Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing:
Approximation algorithms for the p-hub center routing problem in parameterized metric graphs. 271-280 - Eike Neumann, Florian Steinberg:
Parametrised second-order complexity theory with applications to the study of interval computation. 281-304 - Hilda Assiyatun, Dian Kastika Syofyan, Edy Tri Baskoro:
Calculating an upper bound of the locating-chromatic number of trees. 305-309 - Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara:
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs. 310-322 - Koki Takayama, Yusuke Kobayashi:
A strongly polynomial time algorithm for the maximum supply rate problem on trees. 323-331 - Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow:
Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect. 332-343 - Gerold Jäger, Frank Drewes:
The metric dimension of Zn×Zn×Zn is ⌊3n/2⌋. 344-362 - Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn, Anisur Rahaman Molla:
The cost of global broadcast in dynamic radio networks. 363-387 - Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-sink problem on path networks. 388-401 - Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin Varma:
Bipartite graphs of small readability. 402-415 - T.-H. Hubert Chan, Zhibin Liang:
Generalizing the hypergraph Laplacian via a diffusion process with mediators. 416-428 - Arnaud Casteigts, Swan Dubois, Franck Petit, John Michael Robson:
Robustness: A new form of heredity motivated by dynamic networks. 429-445 - Mugang Lin, Qilong Feng, Bin Fu, Jianxin Wang:
An approximation algorithm for the l-pseudoforest deletion problem. 446-454 - Abu Reyan Ahmed, Md. Saidur Rahman, Stephen G. Kobourov:
Online facility assignment. 455-467 - Gang Liu, Zheng Xiao, Guanghua Tan, Kenli Li, Anthony Theodore Chronopoulos:
Game theory-based optimization of distributed idle computing resources in cloud environments. 468-488 - Seth Gilbert, Nancy A. Lynch, Calvin Newport, Dominik Pajak:
On simple back-off in unreliable radio networks. 489-508 - Guangwei Wu, Jianer Chen, Jianxin Wang:
Improved approximation algorithms for two-stage flowshops scheduling problem. 509-515 - Chuan Xu, Joffroy Beauquier, Janna Burman, Shay Kutten, Thomas Nowak:
Data collection in population protocols with non-uniformly random scheduler. 516-530 - Jurek Czyzowicz, Stefan Dobrev, Maxime Godon, Evangelos Kranakis, Toshinori Sakai, Jorge Urrutia:
Searching for a non-adversarial, uncooperative agent on a cycle. 531-542 - Mirza Galib Anwarul Husain Baig, Deepanjan Kesh:
Two improved schemes in the bitprobe model. 543-552 - Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan:
Reconfiguring spanning and induced subgraphs. 553-566 - Kokouvi Hounkanli, Avery Miller, Andrzej Pelc:
Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel. 567-576 - Aniello Murano, Mimmo Parente, Sasha Rubin, Loredana Sorrentino:
Model-checking graded computation-tree logic with finite path semantics. 577-586 - Guanlan Tan, Qilong Feng, Beilin Zhuo, Neng Huang, Jianxin Wang:
New kernels for several problems on planar graphs. 587-594 - Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Priority evacuation from a disk: The case of n = 1, 2, 3. 595-616 - Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta, Lawrence L. Larmore:
Loosely-stabilizing leader election with polylogarithmic convergence time. 617-631 - Sanjib Sadhu, Xiaozhou He, Sasanka Roy, Subhas C. Nandy, Suchismita Roy:
Corrigendum to: "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares" [Theor. Comput. Sci. 769 (2019) 63-74]. 632-640 - Vittorio Bilò, Cosimo Vinci:
The price of anarchy of affine congestion games with similar strategies. 641-654 - Luisa Gargano, Adele Anna Rescigno, Ugo Vaccaro:
Low-weight superimposed codes and related combinatorial structures: Bounds and applications. 655-672 - Koji M. Kobayashi:
Online interval scheduling to maximize total satisfaction. 673-688 - Sylvain Lazard, William J. Lenhart, Giuseppe Liotta:
Corrigendum to "On the edge-length ratio of outerplanar graphs" [Theoret. Comput. Sci. 770 (2019) 88-94]. 689
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-12-04 22:08 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:
