Stop the war!
Остановите войну!
for scientists:
default search action
Theoretical Computer Science, Volume 867
Volume 867, May 2021
- Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh:
Parameterized complexity of fair feedback vertex set problem. 1-12 - Nadia Babou, Djamal Rebaine, Mourad Boudhar:
Two-machine open shop problem with a single server and set-up time considerations. 13-29 - Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen:
Steiner trees for hereditary graph classes: A treewidth perspective. 30-39 - Siu-Wing Cheng, Otfried Cheong, Taegyoung Lee, Zhengtong Ren:
Fitting a graph to one-dimensional data. 40-49 - Magnús M. Halldórsson, Murilo Santos de Lima:
Query-competitive sorting with uncertainty. 50-67 - Feodor F. Dragan, Heather M. Guarnera:
Helly-gap of a graph and vertex eccentricities. 68-84 - Franz J. Brandenburg:
Fan-crossing free graphs and their relationship to other beyond-planar graphs. 85-100 - Peter Kostolányi:
Rational elements of summation semirings. 101-127 - Edita Pelantová, Stepán Starosta:
On Sturmian substitutions closed under derivation. 128-139
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.