Computing the k-Visibility Region of a Point in a Polygon.
- Published in:
- Theory of Computing Systems, 2020, v. 64, n. 7, p. 1292, doi. 10.1007/s00224-020-09999-0
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2020 AND VI 64 AND IP 7
Results: 9
1
2
Analyzing Clustering and Partitioning Problems in Selected VLSI Models.
- Published in:
- Theory of Computing Systems, 2020, v. 64, n. 7, p. 1242, doi. 10.1007/s00224-020-09989-2
- By:
- Publication type:
- Article
3
Complexity and Algorithms for Semipaired Domination in Graphs.
- Published in:
- Theory of Computing Systems, 2020, v. 64, n. 7, p. 1225, doi. 10.1007/s00224-020-09988-3
- By:
- Publication type:
- Article
4
On the Average Case of MergeInsertion.
- Published in:
- Theory of Computing Systems, 2020, v. 64, n. 7, p. 1197, doi. 10.1007/s00224-020-09987-4
- By:
- Publication type:
- Article
5
Complexity of Fall Coloring for Restricted Graph Classes.
- Published in:
- Theory of Computing Systems, 2020, v. 64, n. 7, p. 1183, doi. 10.1007/s00224-020-09982-9
- By:
- Publication type:
- Article
6
Parameterized Complexity of Min-Power Asymmetric Connectivity.
- Published in:
- Theory of Computing Systems, 2020, v. 64, n. 7, p. 1158, doi. 10.1007/s00224-020-09981-w
- By:
- Publication type:
- Article
7
Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings.
- Published in:
- Theory of Computing Systems, 2020, v. 64, n. 7, p. 1273, doi. 10.1007/s00224-020-09980-x
- By:
- Publication type:
- Article
8
Editorial: Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019).
- Published in:
- 2020
- By:
- Publication type:
- Editorial
9
Fixed-Parameter Tractability of (n − k) List Coloring.
- Published in:
- Theory of Computing Systems, 2020, v. 64, n. 7, p. 1307, doi. 10.1007/s00224-020-10014-9
- By:
- Publication type:
- Article