Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Thite, Shripad - Wiskunde en Informatica, Technische Universiteit Eindhoven
Walking Your Dog in the Woods in Polynomial Time Erin W. Chambers Eric Colin de Verdi`ere Jeff Erickson
On Covering a Graph Optimally with Induced Subgraphs
Distance2 Edge Coloring is NPComplete Je# Erickson Shripad Thite David Bunde
jponceg@uiuc.edu UrbanaChampaign
EFFICIENT SPACETIME MESHING WITH NONLOCAL CONE CONSTRAINTS Jeff Ericksona
A Unified Algorithm for Adaptive Spacetime Meshing with Nonlocal Cone Constraints
c 2005 by Shripad Vidyadhar Thite. All rights reserved. SPACETIME MESHING FOR DISCONTINUOUS GALERKIN METHODS
Marketecture: A SimulationBased Framework for Studying Experimental Deregulated Power Markets
EFFICIENT SPACETIME MESHING WITH NONLOCAL CONE CONSTRAINTS
IO-Efficient Point Location and Map Overlay
I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions
I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions
MSRI Workshop on Topological Methods October 26, 2006, Berkeley, CA
A Unified Algorithm for Adaptive Spacetime Meshing
EFFICIENT SPACETIME MESHING WITH NONLOCAL CONE CONSTRAINTS
Efficient Spacetime Meshing with Nonlocal Cone Constraints
ADAPTIVE SPACETIME MESHING IN 2DTIME FOR NONLINEAR AND ANISOTROPIC MEDIA
AN EFFICIENT PARALLEL IMPLEMENTATION OF THE SPACETIME DISCONTINUOUS GALERKIN METHOD USING CHARM++1
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 22, NO. 6, AUGUST 2004 1069 The Distance-2 Matching Problem and Its
Strong Edge Coloring for Channel Assignment in
Distance-2 Edge Coloring is NP-Complete Jeff Erickson Shripad Thite David Bunde
Capturing a Convex Object with Three Discs Jeff Erickson Shripad Thite Fred Rothganger Jean Ponce
IEEE TRANSACTIONS ON ROBOTICS 1 Capturing a Convex Object with Three Discs
SPACETIME MESHING WITH ADAPTIVE COARSENING AND REFINEMENT Reza Abedia
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks
TIGHT BOUNDS ON THE COMPLEXITY OF RECOGNIZING ODD-RANKED ELEMENTS
The Distance2 Matching Problem and its Relationship to the MAClayer Capacity of Ad hoc
An hadaptive SpacetimeDiscontinuous Galerkin Method for Linearized
Spacetime Meshing for Discontinuous Galerkin Methods
MESHING IN 2DTIME FOR FRONT-TRACKING DG METHODS Shripad Thite Jeff Erickson Shuo-Heng Chung
OPTIMUM BINARY SEARCH TREES ON THE HIERARCHICAL MEMORY MODEL SHRIPAD THITE
ADAPTIVE SPACETIME MESHING FOR DISCONTINUOUS GALERKIN METHODS
# 2005 by Shripad Vidyadhar Thite. All rights reserved. SPACETIME MESHING FOR DISCONTINUOUS GALERKIN METHODS
22nd European Workshop on Computational Geometry March 2729, 2006, Delphi, Greece
