1,241 results on '"Widmayer, Peter"'
Search Results
52. Mapping a Polygon with Holes Using a Compass
53. Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty
54. Optimal Placement of Ad Hoc Devices Under a VCG-Style Routing Protocol
55. Maximum Independent Set in 2-Direction Outersegment Graphs
56. Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons
57. An Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
58. On the Complexity of the Metric TSP under Stability Considerations
59. Mapping a polygon with holes using a compass
60. Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids
61. Rendezvous of Mobile Agents in Directed Graphs
62. Reconstructing a Simple Polygon from Its Angles
63. How Simple Robots Benefit from Looking Back
64. Stability of Networks in Stretchable Graphs
65. Reconstructing Visibility Graphs with Simple Robots
66. Pseudonyms in Cost-Sharing Games
67. Online Train Disposition: To Wait or Not to Wait?
68. Shunting for Dummies: An Introductory Algorithmic Survey
69. Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection
70. Reoptimization of Weighted Graph and Covering Problems
71. Bundeswettbewerb Informatik
72. Sequence Hypergraphs: Paths, Flows, and Cuts
73. Programmierung mit PASCAL
74. Angle Optimization in Target Tracking
75. Reoptimization of Steiner Trees
76. Discovery of Network Properties with All-Shortest-Paths Queries
77. Simple Robots in Polygonal Environments: A Hierarchy
78. Rendezvous of Mobile Agents When Tokens Fail Anytime
79. Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game
80. How to Guard a Graph?
81. Computing Best Swaps in Optimal Tree Spanners
82. Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol
83. Counting Targets with Mobile Sensors in an Unknown Environment
84. On the Hardness of Reoptimization
85. Spatial data structures: Concepts and design choices
86. Space filling curves versus random walks
87. Online Delay Management on a Single Train Line
88. Approximate Shortest Paths Guided by a Small Index
89. On the Robustness of Graham’s Algorithm for Online Scheduling
90. Locating Facilities on a Network to Minimize Their Average Service Radius
91. A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
92. Reusing Optimal TSP Solutions for Locally Modified Input Instances : Extended Abstract
93. Strongly Polynomial-Time Truthful Mechanisms in One Shot
94. Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii
95. Online Single Machine Batch Scheduling
96. Pattern Formation by Autonomous Mobile Robots
97. Geometric Routing Without Geometry
98. Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults
99. Joint Base Station Scheduling
100. VisTool: A visualization tool for spatial access structures
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.