Algorithmica an international journal in computer science

Algorithmica : an international journal in computer science

Bibliographic Details
Format: eJournal
Language:English
Published: New York, NY : Springer, 1986-
Physical Description:Online-Ressource
ISSN:1432-0541
0178-4617
Subjects (GND):
Algorithmus ;
Zeitschrift ;
Datenverarbeitung ;
Online-Ressource
Genre:
Zeitschrift
External Sources:https://ezb.ur.de/?1458414-1
http://link.springer.com/journal/453
Deutschlandweit zugänglich
Other Editions:Erscheint auch als (Druck-Ausgabe): Algorithmica . - New York, N.Y. : Springer, 1986
Title Published by
Optimal deterministic sorting and routing on grids and tori with diagonals 1999
A One-Step Crust and Skeleton Extraction Algorithm 2001 Gold, C.
Algorithmic aspects of using small instance relaxations in parallel branch-and-cut 2001 Christof, Thomas, 1966-
An Iterative Displacement Method for Conflict Resolution in Map Generalization 2001 Lonergan, M.
Automated Displacement for Large Numbers of Discrete Map Objects 2001 Mackaness, W. A.
Constraint-Based Processing of Multiway Spatial Joins 2001 Papadias, D.
Contextual Building Typification in Automated Map Generalization 2001 Regnauld, N.
Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems 2001 Amir, A.
Guest Editor’s Foreword 2001 van Kreveld, M.
Right-Triangulated Irregular Networks 2001 Evans, W.
Robust Distance-Based Clustering with Applications to Spatial Data Mining 2001 Estivill-Castro, V.
Structural Lines, TINs, and DEMs 2001 Little, J. J.
Three Rules Suffice for Good Label Placement 2001 Wagner, F.
(Incremental) Priority Algorithms 2003 Borodin, Allan
A Distributed Ant Algorithm for\protect Efficiently Patrolling a Network 2003 Yanovski, Vladimir
A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees 2003 Ayala-Rincón, Mauricio
A Reflective Symmetry Descriptor for 3D Models 2003 Kazhdan, Michael
Algorithms for Minimizing Response Time in Broadcast Scheduling 2003 Gandhi, Rajiv
An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem 2003 Jain, Kamal
Approximating Node Connectivity Problems via Set Covers 2003 Kortsarz, Guy
Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee 2003 Dey, Tamal K.
Approximation Algorithms for a Capacitated Network Design Problem 2003 Hassin, Refael
Approximation Algorithms for Aligning Points 2003 Cabello, Sergio
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness 2003 Fleischer, Rudolf
Blowing Bubbles for Multi-Scale Analysis and Decomposition of Triangle Meshes 2003 Mortara, Michela
Combinatorial and Experimental Methods for Approximate Point Pattern Matching 2003 Gavrilov, Martin
Comparison of Distance Measures for Planar Curves 2003 Alt, Helmut
Computing a (1+ε)-Approximate Geometric Minimum-Diameter Spanning Tree 2003 Spriggs, Michael J.
Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation 2003 Iwata, Satoru
Computing the Quartet Distance between Evolutionary Trees in Time O(n log n) 2003 Brodal, Gerth Stølting
Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition 2003 Bodlaender, Hans L.
Covering with Ellipses 2003 Efrat, Alon
Decomposition of a Three-Dimensional Discrete Object Surface into Discrete Plane Pieces 2003 Sivignon, Isabelle
Delay Optimization in Quorum Consensus 2003 Lin, Xuemin
Disk Embeddings of Planar Graphs 2003 Chen, Zhi-Zhong
Efficient Algorithms for k-Terminal Cuts on Planar Graphs 2003 Chen, Danny Z.
Erratum to “Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes” 2003 Chazal, Fréderic
Escaping a Grid by Edge-Disjoint Paths 2003 Chan, Wun-Tat
Finding Maximum Induced Matchings in Subclasses of Claw-Free and P5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size 2003 Kobler, Daniel
Finding the Consensus Shape for a Protein Family 2003 Chew, L. Paul
Foreword 2003 Takaoka, Tadao
Free-Form Pose Estimation by Using Twist Representations 2003 Rosenhahn, Bodo
Generalization of a Suffix Tree for RNA Structural Pattern Matching 2003 Shibuya, Tetsuo
Guest Editors’ Introduction 2003 Jansen, Klaus
Improved Approximations for Tour and Tree Covers 2003 Könemann, Jochen
Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses 2003 Guruswami, Venkatesan
Labeling Points with Weights 2003 Poon, Sheung-Hung
Linear-Time Recognition of Circular-Arc Graphs 2003 McConnell, Ross M.
Maximum Dispersion and Geometric Maximum Weight Cliques 2003 Fekete, Sándor P.
Minimizing Mean Completion Time in a Batch Processing System 2003 Deng, Xiaotie
Minimum k Arborescences with Bandwidth Constraints 2003 Cai, Mao-cheng
Multicolorings of Series-Parallel Graphs 2003 Zhou, Xiao
New Results on Path Approximation 2003 Daescu, Ovidiu
Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help? 2003 Chin, Francis Y. L.
Parallel Computation of the Topology of Level Sets 2003 Pascucci, Valerio
Polygonal Representations of Digital Sets 2003 Eckhardt, Ulrich
Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems 2003 Galluccio, Anna
Reinforcement Learning with Immediate Rewards and Linear Hypotheses 2003 Abe, Naoki
Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items 2003 Angelelli, Enrico
Shape Algorithmics 2003 Veltkamp, Remco C.
Small Strictly Convex Quadrilateral Meshes of Point Sets 2003 Bremner, David
Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs 2003 Halldórsson, Magnús M.
Testing the Quality of Manufactured Disks and Balls 2003 Bose, Prosenjit
The Relative Complexity of Approximate Counting Problems 2003 Dyer, Martin
A Branch-Checking Algorithm for All-Pairs Shortest Paths 2004 Duin, Cees
A Conjecture on Wiener Indices in Combinatorial Chemistry 2004 Ban, Yih-En Andrew
A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem 2004 Ahuja, Ravindra K.
A General Model for Authenticated Data Structures 2004 Martel, Charles
A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons 2004 Qian, Jianbo
A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology 2004 Xue, Guoliang
Admission Control in Networks with Advance Reservations 2004 Lewin-Eytan, Liane
Algorithms for $ P_{4} $-Comparability Graph Recognition and Acyclic $ P_{4} $-Transitive Orientation 2004 Nikolopoulos, Stavros D.
Algorithms for Computing the QR Decomposition of a Set of Matrices with Common Columns 2004 Yanev, Petko
An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization 2004 Dujmovic, Vida
An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms 2004 Finocchi, Irene
Approximating Min Sum Set Cover 2004 Feige, Uriel
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem 2004 Könemann, Jochen
Approximation Algorithms for Quickest Spanning Tree Problems 2004 Hassin, Refael
Approximation Schemes for Degree-Restricted MST and Red–Blue Separation Problems 2004 Arora, Sanjeev
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines 2004 Epstein\thanks{School of Computer Science, The Interdisciplinary Center, Herzliya, Israel. lea@idc.ac.il., Leah
Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems 2004 Arkin, Esther M.
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems 2004 Gramm, Jens
Bit-Parallel Witnesses and Their Applications to Approximate String Matching 2004 Hyyrö, Heikki
Computing Diameter in the Streaming and Sliding-Window Models 2004 Feigenbaum, Joan
Computing Optimal Diameter-Bounded Polygon Partitions 2004 Damian, Mirela
Diameter and Treewidth in Minor-Closed Graph Families, Revisited 2004 Demaine, Erik D.
Engineering a Lightweight Suffix Array Construction Algorithm 2004 Manzini, Giovanni
Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors 2004 Demaine, Erik D.
Fast Algorithms for Computing the Smallest k-Enclosing Circle 2004 Har-Peled, Sariel
Geographic Quorum System Approximations 2004 Carmi, Paz
Graph Searching, Elimination Trees, and a Generalization of Bandwidth 2004 Fomin, Fedor V.
How Fast Is the k-Means Method? 2004 Har-Peled, Sariel
Matching Polyhedral Terrains Using Overlays of Envelopes 2004 Koltun, Vladlen
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs 2004 Berry, Anne
Minimising the Number of Bends and Volume in 3-Dimensional Orthogonal Graph Drawings with a Diagonal Vertex Layout 2004 Wood, David R.
Minimizing Makespan in Batch Machine Scheduling 2004 Poon, Chung Keung
Minimum Cycle Bases for Network Graphs 2004 Berger, Franziska
Movement Planning in the Presence of Flows 2004 Reif, John H.
Multidimensional Cube Packing 2004 Kohayakawa, Yoshiharu