| Publication | Date of Publication | Type |
|---|
| Going home through an unknown street | 2022-12-16 | Paper |
| Walking streets faster | 2022-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5104357 | 2022-09-09 | Paper |
| Position-independent near optimal searching and on-line recognition in star polygons | 2022-08-19 | Paper |
| Some non-trivial examples of equiprojective polyhedra | 2022-06-10 | Paper |
| Interruptible algorithms for multiproblem solving | 2020-08-31 | Paper |
| Paid exchanges are worth the price | 2020-05-23 | Paper |
| Multi-pivot quicksort: theory and experiments | 2019-09-12 | Paper |
| On the separation and equivalence of paging strategies and other online algorithms | 2019-03-11 | Paper |
| Arbitrary overlap constraints in graph packing problems | 2018-05-14 | Paper |
| Computing \(k\)-atomicity in polynomial time | 2018-04-24 | Paper |
| Generalized streets revisited | 2017-12-05 | Paper |
| Optimal scheduling of contract algorithms with soft deadlines | 2017-09-01 | Paper |
| Multi-processor search and scheduling problems with setup cost | 2017-08-15 | Paper |
| The impact of processing order on performance: a taxonomy of semi-FIFO policies | 2017-06-30 | Paper |
| The within-strip discrete unit disk cover problem | 2017-05-12 | Paper |
| Lower bounds for graph exploration using local policies | 2017-04-05 | Paper |
| On the list update problem with advice | 2017-03-16 | Paper |
| The Hausdorff core problem on simple polygons | 2017-03-09 | Paper |
| Online bin packing with advice | 2017-03-03 | Paper |
| Paid exchanges are worth the price | 2017-01-24 | Paper |
| On the advice complexity of the \(k\)-server problem under sparse metrics | 2017-01-12 | Paper |
| Using parametric transformations toward polynomial kernels for packing problems allowing overlaps | 2016-10-24 | Paper |
| Paging for multi-core shared caches | 2016-10-07 | Paper |
| Lower bounds for graph exploration using local policies | 2016-05-03 | Paper |
| Optimal distributed searching in the plane with and without uncertainty | 2016-05-03 | Paper |
| List colouring and partial list colouring of graphs on-line | 2016-04-04 | Paper |
| Online bin packing with advice | 2016-03-23 | Paper |
| Computing weak consistency in polynomial time (extended abstract) | 2016-03-23 | Paper |
| Online scheduling FIFO policies with admission and push-out | 2016-03-09 | Paper |
| All-Around Near-Optimal Solutions for the Online Bin Packing Problem | 2016-01-11 | Paper |
| Kernelization algorithms for packing problems allowing overlaps | 2015-09-30 | Paper |
| Algorithms in the ultra-wide word model | 2015-09-30 | Paper |
| Parameterized analysis of paging and list update algorithms | 2015-05-26 | Paper |
| On minimum- and maximum-weight minimum spanning trees with neighborhoods | 2015-05-12 | Paper |
| Efficient Online Strategies for Renting Servers in the Cloud | 2015-02-20 | Paper |
| Parameterized algorithms for the \(H\)-packing with \(t\)-overlap problem | 2015-01-15 | Paper |
| On the separation and equivalence of paging strategies | 2014-12-18 | Paper |
| Optimal scheduling of contract algorithms for anytime problem-solving | 2014-11-13 | Paper |
| A parameterized algorithm for packing overlapping subgraphs | 2014-06-24 | Paper |
| Multi-target ray searching problems | 2014-06-06 | Paper |
| An experimental investigation of set intersection algorithms for text searching | 2014-04-01 | Paper |
| On the list update problem with advice | 2014-03-31 | Paper |
| The \({\mathcal{G}}\)-packing with \(t\)-overlap problem | 2014-02-18 | Paper |
| The Distance 4-Sector of Two Points Is Unique | 2014-01-14 | Paper |
| On advice complexity of the \(k\)-server problem under sparse metrics | 2013-12-17 | Paper |
| A Survey of Algorithms and Models for List Update | 2013-09-13 | Paper |
| Minimizing Cache Usage in Paging | 2013-09-13 | Paper |
| On minimum-and maximum-weight minimum spanning trees with neighborhoods | 2013-09-13 | Paper |
| On the discrete unit disk cover problem | 2013-06-24 | Paper |
| A novel approach for leveraging co-occurrence to improve the false positive error in signature files | 2013-06-24 | Paper |
| On the sublinear processor gap for parallel architectures | 2013-05-28 | Paper |
| FIFO queueing policies for packets with heterogeneous processing | 2013-04-19 | Paper |
| Broadcasting in conflict-aware multi-channel networks | 2013-04-12 | Paper |
| List update with probabilistic locality of reference | 2012-07-25 | Paper |
| Optimal strategies for the list update problem under the MRM alternative cost model | 2012-07-18 | Paper |
| A new perspective on list update: probabilistic locality and working set | 2012-07-16 | Paper |
| A fast algorithm for multi-machine scheduling problems with jobs of equal processing times | 2012-01-23 | Paper |
| The cost of cache-oblivious searching | 2011-09-20 | Paper |
| Multi-target ray searching problems | 2011-08-12 | Paper |
| Efficient view point selection for silhouettes of convex polyhedra | 2011-08-02 | Paper |
| Untangled monotonic chains and adaptive range search | 2011-07-27 | Paper |
| Reconstructing convex polygons and convex polyhedra from edge and face counts in orthogonal projections | 2011-05-11 | Paper |
| Finding hidden independent sets in interval graphs | 2011-03-18 | Paper |
| On the discrete unit disk cover problem | 2011-02-20 | Paper |
| Sorting with networks of data structures | 2010-11-05 | Paper |
| An improved line-separable algorithm for discrete unit disk cover | 2010-05-19 | Paper |
| Parameterized Analysis of Paging and List Update Algorithms | 2010-05-11 | Paper |
| Optimal dynamic video-on-demand using adaptive broadcasting | 2010-03-03 | Paper |
| An efficient bounds consistency algorithm for the global cardinality constraint | 2010-03-02 | Paper |
| Online sorted range reporting | 2009-12-17 | Paper |
| Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm | 2009-12-17 | Paper |
| Untangled monotonic chains and adaptive range search | 2009-12-17 | Paper |
| Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance | 2009-10-20 | Paper |
| On the relative dominance of paging algorithms | 2009-09-10 | Paper |
| Drawing \(K_{2,n}\): A lower bound | 2009-03-23 | Paper |
| Principles and Practice of Constraint Programming – CP 2004 | 2008-09-09 | Paper |
| Fast string sorting using order-preserving compression | 2008-06-20 | Paper |
| On the Relative Dominance of Paging Algorithms | 2008-05-27 | Paper |
| Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections | 2008-04-24 | Paper |
| List Update with Locality of Reference | 2008-04-15 | Paper |
| On Certain New Models for Paging with Locality of Reference | 2008-03-25 | Paper |
| Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis | 2008-03-25 | Paper |
| An efficient bounds consistency algorithm for the global cardinality constraint | 2006-02-23 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024783 | 2005-07-04 | Paper |
| LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS | 2005-06-10 | Paper |
| Longest increasing subsequences in sliding windows | 2004-11-12 | Paper |
| On-line parallel heuristics, processor scheduling and robot searching under the competitive framework | 2004-10-27 | Paper |
| Finding hidden independent sets in interval graphs | 2004-10-27 | Paper |
| ONLINE ROUTING IN CONVEX SUBDIVISIONS | 2004-09-29 | Paper |
| Online Parallel Heuristics and Robot Searching under the Competitive Framework | 2004-08-12 | Paper |
| Robot Localization without Depth Perception | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472479 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472971 | 2004-07-07 | Paper |
| Searching and on-line recognition of star-shaped polygons. | 2004-03-14 | Paper |
| A linear lower bound on index size for text retrieval | 2004-03-14 | Paper |
| On universally easy classes for NP-complete problems. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411371 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801183 | 2003-04-07 | Paper |
| A linear lower bound on index size for text retrieval | 2002-01-30 | Paper |
| On universally easy classes for NP-complete problems | 2002-01-30 | Paper |
| The ultimate strategy to search on \(m\) rays? | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952695 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218409 | 1998-11-11 | Paper |
| New lower bounds for element distinctness on a one-tape Turing machine | 1996-02-26 | Paper |
