yusuke1997/dblp-id-title huggingface dataset:
Approximating Rational Objectives Is as Easy as Approximating Linear Ones
Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams
Arboricity-Dependent Algorithms for Edge Coloring
Retrieval of scattered information by EREW, CREW and CRCW PRAMs
Systems of Linear Equations over F 2 and Problems Parameterized above Average
Line-Distortion, Bandwidth and Path-Length of a Graph
Improvements on Geometric Pattern Matching Problems
On Routing Disjoint Paths in Bounded Treewidth Graphs
Approximation Hardness of the Steiner Tree Problem on Graphs
On Trade-Offs in External-Memory Diameter-Approximation
Range Reporting for Time Series via Rectangle Stabbing
Approximation Algorithms for Maximum Linear Arrangement
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs
Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults
Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time
Distribution-Sensitive Algorithms
Robust Matchings and Maximum Clustering
I/O-Efficient Range Minima Queries
Approximating Minimum Sum Coloring with Bundles
Some Recent Strong Inapproximability Results
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local Radius
Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures
Robot Localization without Depth Perception
Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract)
Online Maintenance of k-Medians and k-Covers on a Line
An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths
Clustering Moving Entities in Euclidean Space
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Optimal Parametric Search on Graphs of Bounded Tree-Width
Efficient Computation of All Longest Common Subsequences
Locating Sources to Meet Flow Demands in Undirected Networks
Graph Realizations: Maximum Degree in Vertex Neighborhoods
Packing Rectangles into 2OPT Bins Using Rotations
Lower Bounds for Monotonic List Labeling
Primal-Dual 2-Approximation Algorithm for the Monotonic Multiple Depot Heterogeneous Traveling Salesman Problem
Minimal Elimination of Planar Graphs
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs
On Minimum Sum of Radii and Diameters Clustering
Effective Computation of Immersion Obstructions for Unions of Graph Classes
Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices
No-Dimensional Tverberg Partitions Revisited
Minimizing Makespan for the Lazy Bureaucrat Problem
Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles
17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, Tórshavn, Faroe Islands, June 22-24, 2020
Decomposing the Boundary of a Nonconvex Polyhedron
Call Control with k Rejections
New Algorithms for Distributed Sliding Windows
15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, Reykjavik, Iceland, June 22-24, 2016
Quantum Algorithms for Matrix Products over Semirings
Vertex Partitioning Problems On Partial k-Trees
Fast Updating of Well-Balanced Trees
Covering Problems in Edge- and Node-Weighted Graphs
A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets
Front Matter, Table of Contents, Preface, Program Committee, Subreviewers
B-slack Trees: Space Efficient B-Trees
Constrained Geodesic Centers of a Simple Polygon
16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018, Malmö, Sweden, June 18-20, 2018
Sorting Shuffled Monotone Sequences
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs
Binary Search Trees: How Low Can You Go?
Approximating Maximum Independent Sets by Excluding Subgraphs
Compact Voronoi Diagrams for Moving Convex Polygons
Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts
Computing Shortest Paths in the Plane with Removable Obstacles
Conflict-Free Coloring Made Stronger
The Parameterized Hardness of the k-Center Problem in Transportation Networks
Algorithms for the Multi-constrained Routing Problem
A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset
Non-preemptive Speed Scaling
Ranked Document Selection
Exact Algorithms and Approximation Schemes for Base Station Placement Problems
Resource Augmentation in Load Balancing
A New Trade-Off for Deterministic Dictionaries
An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams
A Parallel Algorithm for Edge-Coloring Partial k-Trees
A Novel Prediction Setup for Online Speed-Scaling
A Dynamic Algorithm for Maintaining Graph Partitions
Competitive Online Routing on Delaunay Triangulations
Convex Hulls in Polygonal Domains
Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives
Simple Confluently Persistent Catenable Lists (Extended Abstract)
Parameterized Study of Steiner Tree on Unit Disk Graphs
A Simple Mergeable Dictionary
Fibonacci Correction Networks
Approximation Algorithms for Edge-Dilation k-Center Problems
Generalization of a Suffix Tree for RNA Structural Pattern Matching
On Feedback Vertex Set New Measure and New Structures
Low-Diameter Graph Decomposition is in NC
Optimal In-Place Compaction of Sliding Cubes
Drawing Graphs with Circular Arcs and Right-Angle Crossings
Sea-Rise Flooding on Massive Dynamic Terrains
Construction of the Nearest Neighbor Embracing Graph of a Point Set
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems
Linear-Time Recognition of Map Graphs with Outerplanar Witness
The Deterministic Complexity of Parallel Multisearch (Extended Abstract)
Approximation Algorithms for the Airport and Railway Problem
Fractional Cascading Simplified
Exact Computation of Maximum Induced Forest
The Parallel Hierarchical Memory Model
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension
Assigning Channels via the Meet-in-the-Middle Approach
Parameterized Orientable Deletion
Deterministic Cache-Oblivious Funnelselect
Faster Parameterized Algorithms for Minor Containment
Efficient Two-dimensional Searching
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid
Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings
On the Visibility Graphs of Pseudo-Polygons: Recognition and Reconstruction
Optimal Orthogonal Drawings of Triconnected Plane Graphs
Faster Parameterized Algorithms for Deletion to Split Graphs
Optimal Deterministic Protocols for Mobile Robots on a Grid
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems (Invited Talk)
The File Distribution Problem for Processor Networks
Maintaining the Visibility Map of Spheres while Moving the Viewpoint on a Circle at Infinity
A Lower Bound and Two Approximate Algorithms for the K-Partitioning of Rectilinear Polygons
Parameterized Aspects of Strong Subgraph Closure
The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
A Tight Lower Bound for On-line Monotonic List Labeling
Approximating the Maximum 3- and 4-Edge-Colorable Subgraph
Structural Complexity Theory: recent Surprises
Excluded Grid Theorem: Improved and Simplified (Invited Talk)
SVM via Saddle Point Optimization: New Bounds and Distributed Algorithms
Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract)
Optimal Flow Aggregation
Parametric Problems on Graphs of Bounded Tree-Width
Simultaneous Embedding with Two Bends per Edge in Polynomial Area
Heap Construction in the Parallel Comparison Tree Model
Reconfiguration of Colorable Sets in Classes of Perfect Graphs
Spanners of Additively Weighted Point Sets
Using Sparsification for Parametric Minimum Spanning Tree Problems
A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon
External Connected Components
Models and Motion Planning
Simplified External Memory Algorithms for Planar DAGs
A Blocked All-Pairs Shortest-Path Algorithm
Dynamic Planar Convex Hull with Optimal Query Time
Flip Distance to some Plane Configurations
An Optimal Algorithm for Finding NCA on Pure Pointer Machines
A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem
Efficient Expected-Case Algorithms for Planar Point Location
On the Online Weighted Non-Crossing Matching Problem
Randomized Algorithms for Finding a Majority Element
Finding the Position of the k -Mismatch and Approximate Tandem Repeats
Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers
Input-Sensitive Compliant Motion in the Plane
New Results on Binary Space Partitions in the Plane (Extended Abstract)
Optimal Exploration of Terrains with Obstacles
New Approximability Results for the Robust k-Median Problem
Algorithm Theory - SWAT '98, 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings
In-Place Algorithms for Computing (Layers of) Maxima
The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights
On the Minimum Augmentation of an l -Connected Graph to a k -Connected Graph
Maximizing the Number of Packed Rectangles
Output-Sensitive Cell Enumeration in Hyperplane Arrangements
Analysis of the Expected Search Cost in Skip Lists
α-Visibility
Win-Win Kernelization for Degree Sequence Completion Problems
Moving an Angle Around a Region
Problems of Posting Sentries: Variations on the Art Gallery Theorem
On Romeo and Juliet Problems: Minimizing Distance-to-Sight
A Uniform Approach Towards Succinct Representation of Trees
Daisy Bloom Filters
Almost Shortest Paths with Near-Additive Error in Weighted Graphs
Parallel and Sequential Approximations of Shortest Superstrings
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees
Constrained Square-Center Problems
Fully Dynamic 2-Edge-Connectivity in Planar Graphs
The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus
The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms
Capacitated max -Batching with Interval Graph Compatibilities
Fast and Efficient Computation of Additively Weighted Voronoi Cells for Applications in Molecular Biology
Probabilistic Data Structures for Priority Queues (Extended Abstract)
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract)
Strictly-Regular Number System and Data Structures
Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
Connectivity Oracles for Planar Graphs
An Approximation Scheme for Bin Packing with Conflicts
An Elementary Approach to Some Analytic Asymptotics
Parameterized Complexity of PCA (Invited Talk)
Simplification of Polyline Bundles
Optimal Bounds for Weak Consistent Digital Rays in 2D
Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs
New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem
Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems
Connectivity of Graphs Under Edge Flips
Path-Reporting Distance Oracles with Linear Size
Parameter Analysis for Guarding Terrains
Implicit Selection
Robust Subgraphs for Trees and Paths
On Covering Problems of Rado
Kernel Bounds for Structural Parameterizations of Pathwidth
Melding Priority Queues
Better Bounds on Online Unit Clustering
Two Hybrid Methods for Collision Resolution in Open Addressing Hashing
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
Dynamic Partition Trees
Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case
Sorting with a Forklift
The Hospitals/Residents Problem with Ties
A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times
Collective Tree Spanners of Graphs
Improved Greedy Algorithms for Constructing Sparse Geometric Spanners
Matching Polyhedral Terrains Using Overlays of Envelopes
Bin-Packing in 1.5 Dimension
Computing the Greedy Spanner in Near-Quadratic Time
Robustness Meets Algorithms (Invited Talk)
Max- and Min-Neighborhood Monopolies
Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees
A Simple Algorithm for Minimum Cuts in Near-Linear Time
Parallel Attribute-Efficient Learning of Monotone Boolean Functions
Improved Algorithms for the Random Cluster Graph Model
On the Hardness of Computing an Average Curve
Planar 3-SAT with a Clause/Variable Cycle
Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies
Vertex Downgrading to Minimize Connectivity
Minimum Convex Partitions and Maximum Empty Polytopes
Batch Coloring Flat Graphs and Thin
The Visibility Diagram: a Data Structure for Visibility Problems and Motion Planning
Tree-Residue Vertex-Breaking: a new tool for proving hardness
Caching for Web Searching
Approximability of Dense Instances of NEAREST CODEWORD Problem
Non-Uniform k-Center and Greedy Clustering
Layered Heaps
Online Scheduling of Splittable Tasks in Peer-to-Peer Networks
I/O Efficient Dynamic Data Structures for Longest Prefix Queries
Improved Bounds for Guarding Plane Graphs with Edges
Time and Space Efficient Multi-method Dispatching
Lower Bounds for Approximation Schemes for Closest String
A Scalable Work Function Algorithm for the k-Server Problem
Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings
Lower Bounds for Dynamic Algorithms
On Triangulating Planar Graphs under the Four-Connectivity Constraint
Bregman Clustering for Separable Instances
Non-Interfering Network Flows
Parameterized Complexity of Two-Interval Pattern Problem
Online Bin Covering with Frequency Predictions
Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P
Algorithms for the Discrete Fréchet Distance Under Translation
Facility Dispersion and Remote Subgraphs
The Multi-multiway Cut Problem
Maintaining Center and Median in Dynamic Trees
Optimal Adaptive Fault Diagnosis of Hypercubes
An Approximation Algorithm for the Wireless Gathering Problem
Confluently Persistent Tries for Efficient Version Control
A Survey of Results for Deletion Channels and Related Synchronization Channels
Bounded-Angle Minimum Spanning Trees
Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths
Coloring Graphs Having Few Colorings Over Path Decompositions
Approximation Algorithms for the Label-Cover MAX and Red-Blue Set Cover Problems
Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings
A Dynamic Space-Efficient Filter with Constant Time Operations
Distributed Disaster Disclosure
Total Stability in Stable Matching Games
Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model
A Linear Kernel for Finding Square Roots of Almost Planar Graphs
On Geometric Structure of Global Roundings for Graphs and Range Spaces
Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding
Uniquely Represented Data Structures for Computational Geometry
Boundary Labeling with Octilinear Leaders
Destroying Densest Subgraphs Is Hard
Independent Set of Intersection Graphs of Convex Objects in 2D
Dynamic 2- and 3-Connectivity on Planar Graphs (Preliminary Version)
Optimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm
Improved Bounds for Wireless Localization
Extending Partial Representations of Proper and Unit Interval Graphs
Approximately Minwise Independence with Twisted Tabulation
Approximate Counting of Matchings in (3, 3)-Hypergraphs
Fast Algorithms for Greedy Triangulation
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
Nearest-Neighbor Decompositions of Drawings
Boolean Analysis of Incomplete Examples
Improved Algorithm for Degree Bounded Survivable Network Design Problem
A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
On-Line Scheduling with Precedence Constraints
Sorting Under Forbidden Comparisons
How to Draw a Series-Parallel Digraph (Extended Abstract)
Boyer-Moore Approach to Approximate String Matching (Extended Abstract)
A Path Cover Technique for LCAs in Dags
The Bottleneck Problem with Minimum Quantity Commitments
Optimizing Symbol Visibility Through Displacement
An Almost Optimal Algorithm for Unbounded Search with Noisy Information
Preclustering Algorithms for Imprecise Points
Sorting Multisets Stably in Minimum Space
Concurrent Multicast in Weighted Networks
Optimally Competitive List Batching
Colouring Diamond-free Graphs
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs
Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees
Independent Covers in Outerplanar Graphs
Sparsity-Parameterised Dynamic Edge Colouring
Lions and Contamination: Monotone Clearings
Randomized Approximation of the Constraint Satisfaction Problem (Extended Abstract)
On the Parameterized Complexity of Grid Contraction
New On-Line Algorithms for the Page Replication Problem
Path Schematization for Route Sketches
Randomized Geometric Algorithms (Abstract)
SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings
On the Locality of Extracting a 2-Manifold in
Intersection Queries in Sets of Disks
Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams
Approximation Algorithms for the Maximum Satisfiability Problem
Testing Superperfection of k-Trees
Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion
A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels
Boundary Labeling for Rectangular Diagrams
GKD-Trees: Binary Trees that Combine Multi-dimensional Data Handling, Node Size and Fringe Reorganization
Task Scheduling in Networks (Extended Abstract)
Online Dominating Set
Unbiased Matrix Rounding
A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs
A Faster Parallel Algorithm for a Matrix Searching Problem
Intersecting Line Segments, Ray Shooting, and Other Applications of Geometric Partitioning Techniques
On the Approximation Hardness of Some Generalizations of TSP
Progress in Selection
Coloring Random Graphs
Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching
On Realizing a Single Degree Sequence by a Bipartite Graph (Invited Paper)
Approximating Finite Weighted Point Sets by Hyperplanes
Dynamic Matching Markets and Voting Paths
Additive Spanners: A Simple Construction
A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares
Do Directional Antennas Facilitate in Reducing Interferences?
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem
Online Embedding of Metrics
On Recognizing and Characterizing Visibility Graphs of Simple Polygons
Recognizing Weakly Triangulated Graphs by Edge Separability
Lagrangian Duality based Algorithms in Online Energy-Efficient Scheduling
Simplifying Activity-On-Edge Graphs
Hard Graphs for Randomized Subgraph Exclusion Algorithms
The Diameter of Caterpillar Associahedra
Formal Language Constrained Path Problems
Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler
On Matroids and Hierarchical Graphs
String Indexing for Patterns with Wildcards
Delta-List Vertex Coloring in Linear Time
Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput
Capacitated Domination Faster Than O (2 n )
An Algorithm for L(2, 1)-Labeling of Trees
Dynamic Graph Algorithms with Applications
Sampling-Based Motion Planning: From Intelligent CAD to Crowd Simulation to Protein Folding (Invited Talk)
Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations
Computing the Threshold for q-Gram Filters
Matroid-Constrained Maximum Vertex Cover: Approximate Kernels and Streaming Algorithms
Speed is More Powerful than Claivoyance
Cuckoo Filter: Simplification and Analysis
Tight Lower Bounds for Shellsort
Trajectory Visibility
Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices
Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks
Efficient Summing over Sliding Windows
Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives
Reconstructing Strings from Substrings with Quantum Queries
Safe and Efficient Traffic Laws for Mobile Robots
Coping with the NP-Hardness of the Graph Bandwidth Problem
Least Adaptive Optimal Search with Unreliable Tests
Memory Requirements for Table Computations in Partial k-tree Algorithms
Space-Efficient Data Structures for Lattices
Performance Tuning an Algorithm for Compressing Relational Tables
Succinct Dynamic One-Dimensional Point Reporting
SWAT 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 11-14, 1990, Proceedings
An Optimal Algorithm for Computing Vissible Nearest Foreign Neighbors Among Colored Line Segments
Online Makespan Minimization with Parallel Schedules
Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs
Solving a Family Of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion
Cache-Oblivious Algorithms and Data Structures
Scheduling Jobs Before Shut-Down
Memory Limited Inductive Inference Machines
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous
Reconstructing the Tree of Life (Fitting Distances by Tree Metrics) (Invited Paper)
Approximation Metatheorems for Classes with Bounded Expansion
Reconstructing a Simple Polygon from Its Angles
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
An O (log log n )-Competitive Binary Search Tree with Optimal Worst-Case Access Times
Randomized Online Multi-threaded Paging
Expected Behaviour Analysis of AVL Trees
Recoloring Interval Graphs with Limited Recourse Budget
Triangulating Planar Graphs While Minimizing the Maximum Degree
A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract)
On the Redundancy of Succinct Data Structures
Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings
Linear-Time Algorithms for Tree Root Problems
On Guarding Rectilinear Domains
Scheduling Jobs on Grid Processors
Improved Upper Bounds for Pairing Heaps
Fast Algorithms for Two Dimensional and Multiple Pattern Matching (Preliminary Version)
An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces
A Plane 1.88-Spanner for Points in Convex Position
Complexity of Finding Maximum Locally Irregular Induced Subgraphs
Minimum and Maximum against k Lies
Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds
Below All Subsets for Some Permutational Counting Problems
On the Number of Regular Vertices of the Union of Jordan Regions
Fast and Effective Task Scheduling in Heterogeneous Systems
An On-Line Performance Visualization Technology
Dynamic load balancing of distributed SPMD computations with explicit message-passing
The MOL project: an open, extensible metacomputer
A Comparison Study of Static Mapping Heuristics for a Class of Meta-tasks on Heterogeneous Computing Systems
Cluster Performance and the Implications for Distributed, Heterogeneous Grid Performance
Heterogeneous Parallel Computing with Java: Jabber or Justified?
Agent-Based Resource Discovery
Distributed Quasi Monte-Carlo Methods in a Heterogeneous Environment
A Debugger for Computational Grid Applications
Scheduling Resources in Multi-User, Heterogeneous, Computing Environments with SmartNet
Linear Algebra Algorithms in Heterogeneous Cluster of Personal Computers
RsdEditor: A Graphical User Interface for Specifying Metacomputer Components
The NRW-Metacomputer-Building Blocks for A Worldwide Computational Grid