default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 133
Volume 133, May 2018
- Evangelos Bampas
, Christina Karousatou, Aris Pagourtzis, Katerina Potika:
Path multicoloring in spider graphs with even color multiplicity. 1-4 - Chen Avin, Alexandr Hercules, Andreas Loukas, Stefan Schmid:
rDAN: Toward robust demand-aware network designs. 5-9 - Karl Bringmann, Sebastian Krinninger:
A note on hardness of diameter approximation. 10-15 - Or Meir, Avishay Tal:
The choice and agreement problems of a random function. 16-20 - Madiel Conserva Filho, Marcel Vinícius Medeiros Oliveira, Augusto Sampaio, Ana Cavalcanti:
Compositional and local livelock analysis for CSP. 21-25 - Sebastian Maneth, Helmut Seidl:
Balancedness of MSO transductions in polynomial time. 26-32 - Sattar Sattari, Mohammad Izadi:
Upper bounds for minimum dilation triangulation in two special cases. 33-38 - Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
On deterministic rendezvous at a node of agents with arbitrary velocities. 39-43 - Tiphaine Viard, Clémence Magnien, Matthieu Latapy:
Enumerating maximal cliques in link streams with durations. 44-48 - Jacinto F. S. Reis, Alexandre Mota:
Aiding exploratory testing with pruned GUI models. 49-55 - Guillaume Ducoffe:
A short note on the complexity of computing strong pathbreadth. 56-58
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-12-19 22:13 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:
