default search action

combined dblp search
author search
venue search
publication search

ask others

Theoretical Computer Science, Volume 770

> Home > Journals > Theoretical Computer Science

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Volume 770, May 2019

- view
  authority control:
- export record
  dblp key:
  - journals/tcs/PenaB19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/PenaB19
Nicolas Pena, Allan Borodin:
On extensions of the deterministic online model for bipartite matching and max-sat. 1-24
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/Manoussakis19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Manoussakis19
George Manoussakis:
A new decomposition technique for maximal clique enumeration for sparse graphs. 25-33
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/GagieHN19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/GagieHN19
Travis Gagie, Meng He, Gonzalo Navarro:
Path queries on functions. 34-50
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/DurocherS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/DurocherS19
Stephane Durocher, Robby Singh:
A simple linear-space data structure for constant-time range minimum query. 51-61
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/TelleV19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/TelleV19
Jan Arne Telle, Yngve Villanger:
FPT algorithms for domination in sparse graphs and beyond. 62-68
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/LeL19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/LeL19
Hoàng-Oanh Le, Van Bang Le:
A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter. 69-78
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/KowalukL19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/KowalukL19
Miroslaw Kowaluk, Andrzej Lingas:
A fast deterministic detection of small pattern graphs in graphs without large cliques. 79-87
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/LazardLL19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/LazardLL19
Sylvain Lazard, William J. Lenhart, Giuseppe Liotta:
On the edge-length ratio of outerplanar graphs. 88-94
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/Harju19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Harju19
Tero Harju:
On square-free arithmetic progressions in infinite words. 95-100
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/Vitanyi19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Vitanyi19
Paul M. B. Vitányi:
Corrigendum to "On the rate of decrease in logical depth" [Theor. Comput. Sci. 702 (2017) 60-64] by L.F. Antunes, A. Souto, and P.M.B. Vitányi. 101

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.