X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
algorithms (54) 54
computer science, theory & methods (32) 32
computer science (30) 30
mathematics, applied (23) 23
computational geometry (19) 19
algorithm (15) 15
complexity (15) 15
computer science - computational geometry (14) 14
mathematics (12) 12
studies (12) 12
algorithm analysis and problem complexity (11) 11
computer science, information systems (11) 11
analysis (10) 10
approximation algorithm (9) 9
india (9) 9
theory of computation (8) 8
approximation (7) 7
arrangement (7) 7
computational theory and mathematics (7) 7
computer communication networks (7) 7
discrete mathematics in computer science (7) 7
duality (7) 7
politics and government (7) 7
approximation algorithms (6) 6
computational mathematics (6) 6
computer science applications (6) 6
computer science, software engineering (6) 6
control and optimization (6) 6
data structures (6) 6
geometry and topology (6) 6
mathematical analysis (6) 6
mathematical models (6) 6
placement (6) 6
civilization (5) 5
computer graphics (5) 5
computer science, hardware & architecture (5) 5
engineering, electrical & electronic (5) 5
graphs (5) 5
index medicus (5) 5
india politics and government (5) 5
polygons (5) 5
prune-and-search (5) 5
wireless networks (5) 5
computation (4) 4
disks (4) 4
geometry (4) 4
geosciences, multidisciplinary (4) 4
groundwater (4) 4
integer programming (4) 4
minimum enclosing circle (4) 4
nationalism (4) 4
np-hardness (4) 4
numeric computing (4) 4
optimization (4) 4
politics (4) 4
programming techniques (4) 4
ptas (4) 4
range assignment (4) 4
sensors (4) 4
shortest path (4) 4
translations into english (4) 4
unit disk graph (4) 4
water, underground (4) 4
algorithmus (3) 3
biography (3) 3
centerpoint (3) 3
circuits (3) 3
complexity theory (3) 3
english poetry (3) 3
female (3) 3
geometric duality (3) 3
heuristic (3) 3
humans (3) 3
imperialism (3) 3
india civilization (3) 3
indic poetry (3) 3
information systems applications (3) 3
levels of arrangement (3) 3
linear programming (3) 3
linear-time (3) 3
mathematical problems (3) 3
mathematics of computing (3) 3
maximum independent set (3) 3
mobile communication (3) 3
mobile communication systems (3) 3
optimization algorithms (3) 3
packing (3) 3
partitioning (3) 3
political science (3) 3
política y gobierno (3) 3
psychological aspects (3) 3
range assignment problem (3) 3
rectangles (3) 3
schemes (3) 3
segments (3) 3
software engineering (3) 3
software engineering/programming and operating systems (3) 3
space-efficient algorithm (3) 3
time (3) 3
two-center problem (3) 3
more...
Library Location Library Location
Library Location Library Location
X
Sort by Item Count (A-Z)
Filter by Count
Robarts - Stacks (9) 9
UTL at Downsview - May be requested (2) 2
UofT at Scarborough - Stacks (2) 2
Collection Dvlpm't (Acquisitions) - Closed Orders (1) 1
Collection Dvlpm't (Acquisitions) - Vendor file (1) 1
Gerstein Science - Stacks (1) 1
New College (Ivey) - Stacks (1) 1
Robarts - May be requested in 6-10 wks (1) 1
St. Michael's College (John M. Kelly) - 2nd Floor (1) 1
Trinity College (John W Graham) - Stacks (1) 1
UofT at Mississauga - Stacks (1) 1
Victoria University E.J. Pratt - Stacks (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


2009, ISBN 9812836233, xii, 371
Book
Theoretical Computer Science, ISSN 0304-3975, 01/2020, Volume 804, pp. 81 - 97
We study the problem of assigning non-overlapping geometric objects centered at a given set of points such that the sum of area covered by them is maximized.... 
Discrete packing | NP-hardness | Range assignment in wireless communication | PTAS | Quadratic programming | Approximation algorithm
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2018
In this paper, we study the SHORTEST COLOR SPANNINGt- INTERVALS problem, and related generalizations, namely SMALLEST COLOR SPANNINGt- SQUARES and SMALLEST... 
Color spanning sets | Computational geometry | Parameterized complexity | Exact algorithms
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 06/2019
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 05/2018, Volume 725, pp. 16 - 30
Given a set of points in and each assigned with one of the given distinct colors, we study the problem of finding the minimum width color spanning annulus of... 
Algorithms | Color spanning annulus | Location planning | Complexity | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 02/2020, Volume 806, pp. 632 - 640
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 05/2019, Volume 769, pp. 63 - 74
This paper discusses the problem of covering and hitting a set of line segments in by a pair of axis-parallel congruent squares of minimum size. We also... 
Hitting line segments by squares | Computational geometry | Two-center problem | Two pass algorithm | Covering line segments by squares | APPROXIMATION | 2-CENTER | BASE-STATION PLACEMENT | BOUNDARY | COMPUTER SCIENCE, THEORY & METHODS | Computer science | Algorithms
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 07/2012, Volume 442, p. 1
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 07/2012, Volume 442, p. 1
Journal Article
Computational Geometry: Theory and Applications, ISSN 0925-7721, 02/2019, Volume 79, pp. 1 - 13
We study several variations of line segment covering problem with axis-parallel unit squares in the plane. Given a set of line segments, the objective is to... 
Linear programming | Approximation algorithms | Unit square | Segment cover | [formula omitted]-hardness | NP-hardness | MATHEMATICS | MATHEMATICS, APPLIED | Hardness | Relaxation | Algorithms
Journal Article
Information Processing Letters, ISSN 0020-0190, 11/2017, Volume 127, pp. 58 - 61
Maximum independent set from a given set of unit disks intersecting a horizontal line can be solved in time and space. As a corollary, we design a factor 2... 
Maximum independent set | Computational geometry | Approximation algorithms | Dynamic programming | Unit disk graph | COMPUTER SCIENCE, INFORMATION SYSTEMS | Algorithms
Journal Article
Information Processing Letters, ISSN 0020-0190, 03/2014, Volume 114, Issue 3, p. 152
  Design and implementation of division algorithm is one of the most complicated problems in multi-precision arithmetic. Huang et al. [1] proposed an efficient... 
Integer programming | Mathematical problems | Computer science | Studies | Algorithms | Proof theory
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 02/2016, Volume 615, pp. 61 - 70
We study a space-efficient algorithm for computing a centerpoint for a set of points in , where the points in are given in a read-only array. We propose an... 
Space-efficient algorithm | Duality | Prune-and-search | Centerpoint | Arrangement
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 02/2016, Volume 615, p. 61
To access, purchase, authenticate, or subscribe to the full-text of this article, please visit this link: http://dx.doi.org/10.1016/j.tcs.2015.11.048 We study... 
Algorithms
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 02/2016, Volume 615, pp. 61 - 70
We study a space-efficient algorithm for computing a centerpoint for a set P of n points in , where the points in P are given in a read-only array. We propose... 
Algorithms | Computation | Computing time | Arrays | Complexity
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 02/2016, Volume 615, pp. 61 - 70
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 07/2012, Volume 442, pp. 1 - 1
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 02/2013, Volume 224, Issue 3, p. 477
  Consider a competitive facility location scenario where, given a set U of n users and a set F of m facilities in the plane, the objective is to place a new... 
Studies | Mathematical problems | Algorithms | Location analysis | Facilities planning | Decision analysis
Journal Article
Information Processing Letters, ISSN 0020-0190, 03/2014, Volume 114, Issue 3, pp. 152 - 157
Design and implementation of division algorithm is one of the most complicated problems in multi-precision arithmetic. Huang et al. proposed an efficient... 
Normalization | Division algorithm | Computational arithmetic | Cryptography | COMPUTER SCIENCE, INFORMATION SYSTEMS | Integers | Data processing | Division | Algorithms | Proving | Arithmetic
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.