Stephan J. Eidenbenz

Orcid: 0000-0002-2628-1854

Affiliations:
  • Los Alamos National Laboratory, NM, USA


According to our database1, Stephan J. Eidenbenz authored at least 177 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Provable bounds for noise-free expectation values computed from noisy samples.
Nat. Comput. Sci., November, 2024

Correction to: Distributed out-of-memory NMF on CPU/GPU architectures.
J. Supercomput., March, 2024

Distributed out-of-memory NMF on CPU/GPU architectures.
J. Supercomput., February, 2024

Quantum-centric supercomputing for materials science: A perspective on challenges and future directions.
, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ,
Future Gener. Comput. Syst., 2024

Expected Maximin Fairness in Max-Cut and other Combinatorial Optimization Problems.
CoRR, 2024

The Better Solution Probability Metric: Optimizing QAOA to Outperform its Warm-Start Solution.
CoRR, 2024

Graph Neural Networks for Parameterized Quantum Circuits Expressibility Estimation.
CoRR, 2024

Guarantees on Warm-Started QAOA: Single-Round Approximation Ratios for 3-Regular MAXCUT and Higher-Round Scaling Limits.
CoRR, 2024

Hierarchical Multigrid Ansatz for Variational Quantum Algorithms.
Proceedings of the ISC High Performance 2024 Research Paper Proceedings (39th International Conference), 2024

Trainability Barriers in Low-Depth QAOA Landscapes.
Proceedings of the 21st ACM International Conference on Computing Frontiers, 2024

2023
Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs.
CoRR, 2023

Probing Quantum Telecloning on Superconducting Quantum Processors.
CoRR, 2023

Lower Bounds on Number of QAOA Rounds Required for Guaranteed Approximation Ratios.
CoRR, 2023

Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation.
CoRR, 2023

Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers.
Proceedings of the High Performance Computing - 38th International Conference, 2023

JuliQAOA: Fast, Flexible QAOA Simulation.
Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, 2023

High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023

Numerical Evidence for Exponential Speed-Up of QAOA over Unstructured Search for Approximate Constrained Optimization.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023

The Quantum Alternating Operator Ansatz for Satisfiability Problems.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023

Predicting Expressibility of Parameterized Quantum Circuits Using Graph Neural Network.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023

LLVM Static Analysis for Program Characterization and Memory Reuse Profile Estimation.
Proceedings of the International Symposium on Memory Systems, 2023

BB-ML: Basic Block Performance Prediction using Machine Learning Techniques.
Proceedings of the 29th IEEE International Conference on Parallel and Distributed Systems, 2023

Scalable Experimental Bounds for Dicke and GHZ States Fidelities.
Proceedings of the 20th ACM International Conference on Computing Frontiers, 2023

2022
Quantum Volume in Practice: What Users Can Expect from NISQ Devices Dataset.
Dataset, May, 2022

PPT-Multicore: performance prediction of OpenMP applications using reuse profiles and analytical modeling.
J. Supercomput., 2022

Scalable Experimental Bounds for Entangled Quantum State Fidelities.
CoRR, 2022

Process Modeling, Hidden Markov Models, and Non-negative Tensor Factorization with Model Selection.
CoRR, 2022

Quantum Volume in Practice: What Users Can Expect from NISQ Devices.
CoRR, 2022

Distributed Out-of-Memory NMF of Dense and Sparse Data on CPU/GPU Architectures with Automatic Model Selection for Exascale Data.
CoRR, 2022

BB-ML: Basic Block Performance Prediction using Machine Learning Techniques.
CoRR, 2022

Evidence for Super-Polynomial Advantage of QAOA over Unstructured Search.
CoRR, 2022

Quantum Telecloning on NISQ Computers.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2022

Short-Depth Circuits for Dicke State Preparation.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2022

Optimized Telecloning Circuits: Theory and Practice of Nine NISQ Clones.
Proceedings of the IEEE International Conference on Rebooting Computing, 2022

2021
Machine Learning-enabled Scalable Performance Prediction of Scientific Codes.
ACM Trans. Model. Comput. Simul., 2021

A Divide-and-Conquer Approach to Dicke State Preparation.
CoRR, 2021

QAOA-based Fair Sampling on NISQ Devices.
CoRR, 2021

Hybrid, scalable, trace-driven performance modeling of GPGPUs.
Proceedings of the International Conference for High Performance Computing, 2021

Sampling on NISQ Devices: "Who's the Fairest One of All?".
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2021

Threshold-Based Quantum Optimization.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2021

Load-Aware Dynamic Time Synchronization in Parallel Discrete Event Simulation.
Proceedings of the SIGSIM-PADS '21: SIGSIM Conference on Principles of Advanced Discrete Simulation, Virtual Event, USA, 31 May, 2021

2020
Code Characterization With Graph Convolutions and Capsule Networks.
IEEE Access, 2020

Embedding Algorithms for Quantum Annealers with Chimera and Pegasus Connection Topologies.
Proceedings of the High Performance Computing - 35th International Conference, 2020

The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2020

Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2020

PPT-SASMM: Scalable Analytical Shared Memory Model: Predicting the Performance of Multicore Caches from a Single-Threaded Execution Trace.
Proceedings of the MEMSYS 2020: The International Symposium on Memory Systems, 2020

NVIDIA GPGPUs Instructions Energy Consumption.
Proceedings of the IEEE International Symposium on Performance Analysis of Systems and Software, 2020

Fast, accurate, and scalable memory modeling of GPGPUs using reuse profiles.
Proceedings of the ICS '20: 2020 International Conference on Supercomputing, 2020

Verified instruction-level energy consumption measurement for NVIDIA GPUs.
Proceedings of the 17th ACM International Conference on Computing Frontiers, 2020

2019
Modeling Shared Cache Performance of OpenMP Programs using Reuse Distance.
CoRR, 2019

Instructions' Latencies Characterization for NVIDIA GPGPUs.
CoRR, 2019

The ISTI Rapid Response on Exploring Cloud Computing 2018.
CoRR, 2019

PPT-GPU: Scalable GPU Performance Modeling.
IEEE Comput. Archit. Lett., 2019

Online Dominating Set.
Algorithmica, 2019

Scalable Performance Prediction of Codes with Memory Hierarchy and Pipelines.
Proceedings of the 2019 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, 2019

GPUs Cache Performance Estimation using Reuse Distance Analysis.
Proceedings of the 38th IEEE International Performance Computing and Communications Conference, 2019

Low Overhead Instruction Latency Characterization for NVIDIA GPGPUs.
Proceedings of the 2019 IEEE High Performance Extreme Computing Conference, 2019

Deterministic Preparation of Dicke States.
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

POSTER: GPUs Pipeline Latency Analysis.
Proceedings of the 30th IEEE International Conference on Application-specific Systems, 2019

2018
Quantum Algorithm Implementations for Beginners.
CoRR, 2018

Just-in-Time Parallel simulation.
Proceedings of the 2018 Winter Simulation Conference, 2018

Imcsim: Parameterized Performance Prediction for Implicit Monte Carlo codes.
Proceedings of the 2018 Winter Simulation Conference, 2018

Parallel Application Performance Prediction Using Analysis Based Models and HPC Simulations.
Proceedings of the 2018 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, 2018

Sampling Simulation Model Profile Data for Analysis.
Proceedings of the 2018 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, 2018

PPT-GPU: performance prediction toolkit for GPUs identifying the impact of caches: extended abstract.
Proceedings of the International Symposium on Memory Systems, 2018

Synthesis of Parallel Programs on Multi-Cores.
Proceedings of the Handbook of Grammatical Evolution, 2018

2017
Some properties of communication behaviors in discrete-event simulation models.
Proceedings of the 2017 Winter Simulation Conference, 2017

An analytical memory hierarchy model for performance prediction.
Proceedings of the 2017 Winter Simulation Conference, 2017

A brief history of HPC simulation and future challenges.
Proceedings of the 2017 Winter Simulation Conference, 2017

A Scalable Analytical Memory Model for CPU Performance Prediction.
Proceedings of the High Performance Computing Systems. Performance Modeling, Benchmarking, and Simulation, 2017

Probabilistic Monte Carlo simulations for static branch prediction.
Proceedings of the 36th IEEE International Performance Computing and Communications Conference, 2017

A Probabilistic Monte Carlo Framework for Branch Prediction.
Proceedings of the 2017 IEEE International Conference on Cluster Computing, 2017

AMM: Scalable Memory Reuse Model to Predict the Performance of Physics Codes.
Proceedings of the 2017 IEEE International Conference on Cluster Computing, 2017

2016
GPU Performance Prediction Through Parallel Discrete Event Simulation and Common Sense.
EAI Endorsed Trans. Ubiquitous Environ., 2016

Discrete event performance prediction of speculatively parallel temperature-accelerated dynamics.
Simul., 2016

Predicting performance of Smoothed Particle Hydrodynamics codes at large scales.
Proceedings of the Winter Simulation Conference, 2016

Design, Use and Evaluation of P-FSEFI: A Parallel Soft Error Fault Injection Framework for Emulating Soft Errors in Parallel Applications.
Proceedings of the 9th EAI International Conference on Simulation Tools and Techniques, 2016

An Integrated Interconnection Network Model for Large-Scale Performance Prediction.
Proceedings of the 2016 annual ACM Conference on SIGSIM Principles of Advanced Discrete Simulation, 2016

Scalable Interconnection Network Models for Rapid Performance Prediction of HPC Applications.
Proceedings of the 18th IEEE International Conference on High Performance Computing and Communications; 14th IEEE International Conference on Smart City; 2nd IEEE International Conference on Data Science and Systems, 2016

2015
TADSim: Discrete Event-Based Performance Prediction for Temperature-Accelerated Dynamics.
ACM Trans. Model. Comput. Simul., 2015

The simian concept: parallel discrete event simulation with interpreted languages and just-in-time compilation.
Proceedings of the 2015 Winter Simulation Conference, 2015

Parameterized benchmarking of parallel discrete event simulation systems: communication, computation, and memory.
Proceedings of the 2015 Winter Simulation Conference, 2015

Simian integrated framework for parallel discrete event simulation on GPUs.
Proceedings of the 2015 Winter Simulation Conference, 2015

2014
Hierarchical and Matrix Structures in a Large Organizational Email Network: Visualization and Modeling Approaches.
Proceedings of the Social Network Analysis - Community Detection and Evolution, 2014

Hierarchical and Matrix Structures in a Large Organizational Email Network: Visualization and Modeling Approaches.
CoRR, 2014

Developing parallel, discrete event simulations in Python - first results and user experiences with the SimX library.
Proceedings of the 4th International Conference On Simulation And Modeling Methodologies, 2014

Sim-Watchdog: Leveraging Temporal Similarity for Anomaly Detection in Dynamic Graphs.
Proceedings of the IEEE 34th International Conference on Distributed Computing Systems, 2014

2013
iDispatcher: A unified platform for secure planet-scale information dissemination.
Peer-to-Peer Netw. Appl., 2013

Editorial for Computer Networks special issue on ''Towards a Science of Cyber Security''.
Comput. Networks, 2013

Themis-1: an agent-based model of a modern monetary reserve system.
Proceedings of the Agent-Directed Simulation Symposium, 2013

Visualization and modeling of structural features of a large organizational email network.
Proceedings of the Advances in Social Networks Analysis and Mining 2013, 2013

2012
Detection of Selfish Manipulation of Carrier Sensing in 802.11 Networks.
IEEE Trans. Mob. Comput., 2012

Link Positions Matter: A Noncommutative Routing Metric for Wireless Mesh Networks.
IEEE Trans. Mob. Comput., 2012

Optimization principles for arithmetic functions in hardware-software co-design.
Proceedings of the Winter Simulation Conference, 2012

Containment of misinformation spread in online social networks.
Proceedings of the Web Science 2012, 2012

SimCore: A Library for Rapid Development of Large Scale Parallel Simulations.
Proceedings of the SIMULTECH 2012 - Proceedings of the 2nd International Conference on Simulation and Modeling Methodologies, Technologies and Applications, Rome, Italy, 28, 2012

Toward comprehensive and accurate simulation performance prediction of parallel file systems.
Proceedings of the IEEE/IFIP International Conference on Dependable Systems and Networks, 2012

2011
Optimal Placement of Ad Hoc Devices Under a VCG-Style Routing Protocol.
Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

AntBot: Anti-pollution peer-to-peer botnets.
Comput. Networks, 2011

Lattice routing: A 4D routing scheme for multiradio multichannel ad hoc networks.
Ad Hoc Networks, 2011

Poster: FLAMBES: evolving fast performance models.
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, 2011

Measuring the effectiveness of infrastructure-level detection of large-scale botnets.
Proceedings of the 19th International Workshop on Quality of Service, 2011

RatBot: Anti-enumeration Peer-to-Peer Botnets.
Proceedings of the Information Security, 14th International Conference, 2011

Geography-based analysis of the Internet infrastructure.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

Malware propagation in online social networks: nature, dynamics, and defense implications.
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security, 2011

2010
Criticality analysis of Internet infrastructure.
Comput. Networks, 2010

CyberSim: Geographic, temporal, and organizational dynamics of malware propagation.
Proceedings of the 2010 Winter Simulation Conference, 2010

Explicit Spatial Scattering for Load Balancing in Conservatively Synchronized Parallel Discrete Event Simulations.
Proceedings of the 24th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation, 2010

2009
Modeling Propagation Dynamics of Bluetooth Worms (Extended Version).
IEEE Trans. Mob. Comput., 2009

Incentive Compatible and Globally Efficient Position Based Routing for Selfish Reverse Multicast in Wireless Sensor Networks.
Algorithms, 2009

Accelerating Traffic Microsimulations: A Parallel Discrete-event Queue-based Approach for Speed and Scale.
Proceedings of the 2009 Winter Simulation Conference, 2009

SessionSim: Activity-Based Session Generation for Network Simulation.
Proceedings of the 2009 Winter Simulation Conference, 2009

Mobi-watchdog: you can steal, but you can't run!
Proceedings of the Second ACM Conference on Wireless Network Security, 2009

ActivitySim: large-scale agent-based activity generation for infrastructure simulation.
Proceedings of the 2009 Spring Simulation Multiconference, SpringSim 2009, 2009

Large-scale telephone network simulation: discrete event vs. steady state.
Proceedings of the 2009 Spring Simulation Multiconference, SpringSim 2009, 2009

SMS-Watchdog: Profiling Social Behaviors of SMS Users for Anomaly Detection.
Proceedings of the Recent Advances in Intrusion Detection, 12th International Symposium, 2009

On a locally minimum cost forwarding game.
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing, 2009

Detecting Selfish Exploitation of Carrier Sensing in 802.11 Networks.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Designing systems for large-scale, discrete-event simulations: Experiences with the FastTrans parallel microsimulator.
Proceedings of the 16th International Conference on High Performance Computing, 2009

Blue-Watchdog: Detecting Bluetooth worm propagation in public areas.
Proceedings of the 2009 IEEE/IFIP International Conference on Dependable Systems and Networks, 2009

On the effectiveness of structural detection and defense against P2P-based botnets.
Proceedings of the 2009 IEEE/IFIP International Conference on Dependable Systems and Networks, 2009

2008
The COMMIT Protocol for Truthful and Cost-Efficient Routing in Ad Hoc Networks with Selfish Nodes.
IEEE Trans. Mob. Comput., 2008

On the Complexity of Variations of Equal Sum Subsets.
Nord. J. Comput., 2008

Catching Instant Messaging Worms with Change-Point Detection Techniques.
Proceedings of the First USENIX Workshop on Large-Scale Exploits and Emergent Threats, 2008

DDoS Mitigation in Non-cooperative Environments.
Proceedings of the NETWORKING 2008, Ad Hoc and Sensor Networks, Wireless Networks, 2008

FairCast: fair multi-media streaming in ad hoc networks through local congestion control.
Proceedings of the 11th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2008

Dynamic Balancing of Packet Filtering Workloads on Distributed Firewalls.
Proceedings of the 16th International Workshop on Quality of Service, 2008

Link Positions Matter: A Noncommutative Routing Metric for Wireless Mesh Network.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

On the Impact of Realism of Mobility Models for Wireless Networks.
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

2007
On a New Class of Load Balancing Network Protocols.
Adv. Complex Syst., 2007

COBRA - A Multi-path Adaptive Local Load Sensing Routing Protocol for Wireless Sensor Networks.
Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, 2007

The Optimum Number of OSPF Areas for MANETs.
Proceedings of the Fourth Annual IEEE Communications Society Conference on Sensor, 2007

Light-Weight Control of Non-responsive Traffic with Low Buffer Requirements.
Proceedings of the NETWORKING 2007. Ad Hoc and Sensor Networks, 2007

Revisiting minimum cost reliable routing in wireless mesh networks.
Proceedings of the 13th Annual International Conference on Mobile Computing and Networking, 2007

Scalable and Reliable Sensor Network Routing: Performance Study from Field Deployment.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Modeling Propagation Dynamics of Bluetooth Worms.
Proceedings of the 27th IEEE International Conference on Distributed Computing Systems (ICDCS 2007), 2007

Preventing Bandwidth Abuse at the Router through Sending Rate Estimate-Based Active Queue Management.
Proceedings of IEEE International Conference on Communications, 2007

Incentive-Compatible, Energy-Optimal, and Efficient Ad Hoc Networking in a Selfish Milieu.
Proceedings of the 40th Hawaii International International Conference on Systems Science (HICSS-40 2007), 2007

Low Overhead Router-Based Congestion Control Techniques to Protect Responsive Traffic.
Proceedings of the Global Communications Conference, 2007

Bluetooth worm propagation: mobility pattern matters!
Proceedings of the 2007 ACM Symposium on Information, Computer and Communications Security, 2007

Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2007

2006
Equilibria in Topology Control Games for Ad Hoc Networks.
Mob. Networks Appl., 2006

Finding minimum hidden guard sets in polygons - tight approximability results.
Comput. Geom., 2006

Multi-scale integrated information and telecommunications system (MIITS): first results from a large-scale end-to-end network simulator.
Proceedings of the Winter Simulation Conference WSC 2006, 2006

Describing MANETS: principal component analysis of sparse mobility traces.
Proceedings of the 3rd ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, 2006

Algorithmic aspects of communication in ad-hoc networks with smart antennas.
Proceedings of the 7th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2006

OURS: optimal unicast routing systems in non-cooperative wireless networks.
Proceedings of the 12th Annual International Conference on Mobile Computing and Networking, 2006

Sluggish Calendar Queues for Network Simulation.
Proceedings of the 14th International Symposium on Modeling, 2006

Bluetooth Worms: Models, Dynamics, and Defense Implications.
Proceedings of the 22nd Annual Computer Security Applications Conference (ACSAC 2006), 2006

2005
Partial Digest is hard to solve for erroneous input data.
Theor. Comput. Sci., 2005

Parametric Probabilistic Routing in Sensor Networks.
Mob. Networks Appl., 2005

Complexity and Approximability of Double Digest.
J. Bioinform. Comput. Biol., 2005

Los Alamos communication network simulation.
Proceedings of the 37th Winter Simulation Conference, Orlando, FL, USA, December 4-7, 2005, 2005

Probabilistic multi-path vs. deterministic single-path protocols for dynamic ad-hoc network scenarios.
Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

Maneuverable Relays to Improve Energy Efficiency in Sensor Networks.
Proceedings of the 3rd IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2005 Workshops), 2005

COMMIT: A Sender-Centric Truthful and Energy-Efficient Routing Protocol for Ad Hoc Networks with Selfish Nodes.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

2004
Preface.
Theor. Comput. Sci., 2004

Measurement Errors Make the Partial Digest Problem NP-Hard.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003
An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee.
SIAM J. Comput., 2003

Parametric probabilistic sensor network routing.
Proceedings of the Second ACM International Conference on Wireless Sensor Networks and Applications, 2003

Noisy Data Make the Partial Digest Problem NP-hard.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents.
Proceedings of the Ninth Annual International Conference on Mobile Computing and Networking, 2003

Flexible Train Rostering.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Composing Equipotent Teams.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations.
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003

2002
Approximation algorithms for terrain guarding.
Inf. Process. Lett., 2002

Inapproximability of finding maximum hidden sets on polygons and terrains.
Comput. Geom., 2002

Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains.
Proceedings of the Algorithm Theory, 2002

2001
Inapproximability Results for Guarding Polygons and Terrains.
Algorithmica, 2001

2000
MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs.
Proceedings of the Theoretical Computer Science, 2000

1999
How Many People Can Hide in a Terrain?
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1998
Inapproximability Results for Guarding Polygons without Holes.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result.
Proceedings of the Algorithms, 1998

A Prototype System for Light Propagation in Terrains.
Proceedings of the Computer Graphics International Conference, 1998

A modified longest side bisection triangulation.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Inapproximability of some art gallery problems.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998


  Loading...