Suchergebnisse - "Levcopoulos, Christos"

Local Routing in Sparse and Lightweight Geometric Graphs.

Autoren: Ashvinkumar, Vikrant Gudmundsson, Joachim Levcopoulos, Christos et al.

Quelle: Algorithmica; May2022, Vol. 84 Issue 5, p1316-1340, 25p

Schlagwörter: PLANAR graphs, ONLINE algorithms, SPANNING trees, ROUTING algorithms, COMPUTATIONAL geometry, TRIANGULATION

3D Rectangulations and Geometric Matrix Multiplication.

Autoren: Floderus, Peter Jansson, Jesper Levcopoulos, Christos et al.

Quelle: Algorithmica; Jan2018, Vol. 80 Issue 1, p136-154, 19p

Schlagwörter: GEOMETRY, MATRIX multiplications, MATRICES (Mathematics), ORTHOGONAL functions, POLYHEDRA

Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors).

Autoren: Gąsieniec, Leszek Klasing, Ralf Levcopoulos, Christos et al.

Quelle: SOFSEM 2017: Theory & Practice of Computer Science; 2017, p229-240, 12p

Efficiently Correcting Matrix Products.

Autoren: Gąsieniec, Leszek Levcopoulos, Christos Lingas, Andrzej et al.

Quelle: Algorithmica; Oct2017, Vol. 79 Issue 2, p428-443, 16p

Schlagwörter: ERROR correction (Information theory), MATRIX multiplications, DETERMINISTIC algorithms, DETERMINISTIC processes, ERROR analysis in mathematics

Clearing Connections by Few Agents.

Autoren: Levcopoulos, Christos Lingas, Andrzej Nilsson, Bengt J. et al.

Quelle: Fun with Algorithms (9783319078892); 2014, p289-300, 12p

3D Rectangulations and Geometric Matrix Multiplication.

Autoren: Floderus, Peter Jansson, Jesper Levcopoulos, Christos et al.

Quelle: Algorithms & Computation: 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings; 2014, p65-78, 14p

Covering a Set of Points with a Minimum Number of Lines.

Autoren: Calamoneri, Tiziana Finocchi, Irene Italiano, Giuseppe F. et al.

Quelle: Algorithms & Complexity; 2006, p6-17, 12p

FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM.

Autoren: BORGELT, MAGDALENE GRANTSON BORGELT, CHRISTIAN LEVCOPOULOS, CHRISTOS

Quelle: International Journal of Computational Geometry & Applications; Jun2008, Vol. 18 Issue 3, p185-220, 36p, 1 Black and White Photograph, 17 Diagrams, 4 Charts, 3 Graphs

Schlagwörter: TRIANGULATION, ALGORITHMS, POLYGONS, MATHEMATICAL optimization, MATHEMATICAL analysis

Approximate Distance Oracles for Geometric Spanners.

Autoren: Gudmundsson, Joachim Levcopoulos, Christos Narasimhan, Giri et al.

Quelle: ACM Transactions on Algorithms; 2008, Vol. 4 Issue 1, p10:1-10:34, 34p, 4 Diagrams, 4 Charts

Schlagwörter: ARBITRARY constants, MATHEMATICAL constants, GEOMETRY, CHARTS, diagrams, etc., GRAPHIC methods

BALANCED PARTITION OF MINIMUM SPANNING TREES.

Autoren: Andersson, Mattias Gudmundsson, Joachim Levcopoulos, Christos et al.

Quelle: International Journal of Computational Geometry & Applications; Aug2003, Vol. 13 Issue 4, p303, 14p, 4 Diagrams

Schlagwörter: TREE graphs, ALGORITHMS, APPROXIMATION theory

FAST GREEDY ALGORITHMS FOR CONSTRUCTING SPARSE GEOMETRIC SPANNERS.

Autoren: Gudmundsson, Joachim Levcopoulos, Christos Narasimhan, Giri

Quelle: SIAM Journal on Computing; 2002, Vol. 31 Issue 5, p1479, 22p

Schlagwörter: ALGORITHMS, GRAPH theory

FAST GREEDY ALGORITHMS FOR CONSTRUCTING SPARSE GEOMETRIC SPANNERS.

Autoren: Gudmundsson, Joachim Levcopoulos, Christos Narasimham, Giri

Quelle: SIAM Journal on Computing; 2001, Vol. 31 Issue 3, p1479, 22p

Schlagwörter: ALGORITHMS, EUCLID'S elements, GEOMETRY, RESEARCH

On approximation behavior of the greedy triangulation for convex polygons.

Autoren: Levcopoulos, Christos Lingas, Andrzej

Quelle: Algorithmica; Nov1987, Vol. 2 Issue 1-4, p175-193, 19p

FrontMatter.

Quelle: Algorithms & Discrete Applied Mathematics: Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings; 2016, pI-XIII, 13p

BackMatter.

Quelle: Algorithms & Computation: 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings; 2014, p779-781, 3p

FrontMatter.

Quelle: Language & Automata Theory & Applications: 8th International Conference, LATA 2014, Madrid, Spain, March 10-14, 2014. Proceedings; 2014, pI-XIV, 14p

BackMatter.

Quelle: Fun with Algorithms (9783319078892); 2014, p1-1, 1p

BackMatter.

Quelle: SOFSEM 2017: Theory & Practice of Computer Science; 2017, p525-526, 2p

BackMatter.

Quelle: LATIN 2014: Theoretical Informatics; 2014, p1-1, 1p

FrontMatter.

Quelle: Algorithms & Discrete Applied Mathematics; 2015, p1-1, 1p