| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147557 | 2024-01-15 | Paper |
| Approximation of coNP sets by NP-complete sets | 2023-12-12 | Paper |
| Marriage and Roommate | 2023-11-16 | Paper |
| Small Complexity Gaps for Comparison-Based Sorting | 2023-06-30 | Paper |
| Finding dense subgraphs | 2023-03-21 | Paper |
| Greedily finding a dense subgraph | 2022-12-09 | Paper |
| Tight competitive analyses of online car-sharing problems | 2022-10-24 | Paper |
| Bounded Hanoi | 2022-04-22 | Paper |
| Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing | 2021-12-20 | Paper |
| Improved average complexity for comparison-based sorting | 2020-01-22 | Paper |
| Read-Once Branching Programs for Tree Evaluation Problems | 2019-12-16 | Paper |
| Parameterized Testability | 2019-12-06 | Paper |
| Averaging Techniques for Competitive Auctions | 2019-09-16 | Paper |
| Improving man-optimal stable matchings by minimum change of preference lists | 2019-03-26 | Paper |
| Correction to: ``Pareto optimization or cascaded weighted sum: a comparison of concepts | 2019-03-26 | Paper |
| Randomized competitive analysis for two server problems | 2018-08-20 | Paper |
| Online knapsack with resource augmentation | 2017-11-03 | Paper |
| Total Stability in Stable Matching Games | 2017-10-17 | Paper |
| Improved average complexity for comparison-based sorting | 2017-09-22 | Paper |
| A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties | 2017-08-31 | Paper |
| Parameterized testability | 2017-05-19 | Paper |
| A 25/17-approximation algorithm for the stable marriage problem with one-sided ties | 2017-05-17 | Paper |
| Read-Once Branching Programs for Tree Evaluation Problems. | 2017-03-03 | Paper |
| Quantum query complexity of almost all functions with fixed on-set size | 2016-11-30 | Paper |
| Undecidability on quantum finite automata | 2016-09-29 | Paper |
| Approximate strip packing: revisited | 2016-07-07 | Paper |
| A faster parallel algorithm for \(k\)-connectivity | 2016-05-26 | Paper |
| The hospitals/residents problem with lower quotas | 2016-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501274 | 2015-08-03 | Paper |
| Online bin packing with \((1,1)\) and \((2,R)\) bins | 2015-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934607 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934715 | 2014-12-18 | Paper |
| Enumeration of isolated cliques and pseudo-cliques | 2014-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921716 | 2014-10-13 | Paper |
| Approximation algorithms for the sex-equal stable marriage problem | 2014-09-09 | Paper |
| RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC | 2014-08-04 | Paper |
| Reputation games for undirected graphs | 2014-02-18 | Paper |
| The Train Delivery Problem Revisited | 2014-01-14 | Paper |
| Online Bin Packing with (1,1) and (2,R) Bins | 2013-12-10 | Paper |
| A Harmonic Algorithm for the 3D Strip Packing Problem | 2013-07-24 | Paper |
| Recovering Strings in Oracles: Quantum and Classic | 2012-11-02 | Paper |
| Quantum counterfeit coin problems | 2012-10-11 | Paper |
| Improved approximation bounds for the student-project allocation problem with preferences over projects | 2012-09-13 | Paper |
| Reconstructing Strings from Substrings with Quantum Queries | 2012-08-14 | Paper |
| Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs | 2011-12-16 | Paper |
| The Hospitals/Residents Problem with Quota Lower Bounds | 2011-09-16 | Paper |
| Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects | 2011-07-01 | Paper |
| Quantum Sampling for Balanced Allocations | 2011-03-18 | Paper |
| Randomized Approximation of the Stable Marriage Problem | 2011-03-18 | Paper |
| A randomized algorithm for two servers in cross polytope spaces | 2011-02-21 | Paper |
| Average-case competitive analyses for one-way trading | 2011-02-18 | Paper |
| Improved Randomized Algorithms for 3-SAT | 2010-12-09 | Paper |
| Quantum Counterfeit Coin Problems | 2010-12-09 | Paper |
| A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties | 2010-09-06 | Paper |
| An improved approximation lower bound for finding almost stable maximum matchings | 2010-08-20 | Paper |
| Improved approximation results for the stable marriage problem | 2010-08-14 | Paper |
| Online chasing problems for regular polygons | 2010-06-09 | Paper |
| The complexity of the Hajós calculus for planar graphs | 2010-03-09 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Distributed Computing | 2010-02-23 | Paper |
| Quantum lower bounds for the Goldreich-Levin problem | 2009-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395987 | 2009-09-15 | Paper |
| Drawing borders efficiently | 2009-08-06 | Paper |
| Theory and Applications of Satisfiability Testing | 2009-07-24 | Paper |
| The orthogonal CNN problem | 2009-07-21 | Paper |
| Quantum Queries on Permutations with a Promise | 2009-07-09 | Paper |
| Negation-limited complexity of parity and inverters | 2009-06-22 | Paper |
| Inclusion-exclusion for \(k\)-CNF formulas | 2009-04-28 | Paper |
| An Improved Exact Algorithm for Cubic Graph TSP | 2009-03-06 | Paper |
| Properties of Symmetric Incentive Compatible Auctions | 2009-03-06 | Paper |
| Optimal Resource Augmentations for Online Knapsack | 2009-02-17 | Paper |
| Approximation Algorithms for the Sex-Equal Stable Marriage Problem | 2009-02-17 | Paper |
| Quantum Query Complexity of Boolean Functions with Small On-Sets | 2009-01-29 | Paper |
| Reductions for monotone Boolean circuits | 2008-12-12 | Paper |
| Randomized Competitive Analysis for Two-Server Problems | 2008-11-25 | Paper |
| Polynomial-Time Construction of Linear Network Coding | 2008-08-28 | Paper |
| Average-Case Competitive Analyses for One-Way Trading | 2008-07-10 | Paper |
| A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem | 2008-07-01 | Paper |
| Online removable square packing | 2008-06-06 | Paper |
| Unbounded-Error Classical and Quantum Communication Complexity | 2008-05-27 | Paper |
| Finite-State Online Algorithms and Their Automated Competitive Analysis | 2008-04-24 | Paper |
| Negation-Limited Complexity of Parity and Inverters | 2008-04-24 | Paper |
| Max-stretch reduction for tree spanners | 2008-04-03 | Paper |
| A Randomized Algorithm for Two Servers in Cross Polytope Spaces | 2008-02-20 | Paper |
| Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs | 2008-01-04 | Paper |
| Strip Packing vs. Bin Packing | 2008-01-04 | Paper |
| Unbounded-Error One-Way Classical and Quantum Communication Complexity | 2007-11-28 | Paper |
| Drawing Borders Efficiently | 2007-11-15 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Improved Algorithms for Quantum Identification of Boolean Oracles | 2007-09-07 | Paper |
| Reductions for Monotone Boolean Circuits | 2007-09-05 | Paper |
| Quantum Network Coding | 2007-09-03 | Paper |
| Exploiting partial knowledge of satisfying assignments | 2007-08-23 | Paper |
| Improved algorithms for quantum identification of Boolean oracles | 2007-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3437580 | 2007-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3437581 | 2007-05-09 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Density condensation of Boolean formulas | 2007-01-09 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Parallelizing local search for CNF satisfiability using vectorization and PVM | 2005-08-04 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| Average-case competitive analyses for ski-rental problems | 2005-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673413 | 2005-04-29 | Paper |
| Single backup table schemes for shortest-path routing | 2005-04-06 | Paper |
| Avoiding routing loops on the internet | 2005-02-11 | Paper |
| Randomized approximation of the stable marriage problem | 2004-10-27 | Paper |
| Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs | 2004-10-04 | Paper |
| Transformation rules for CNOT-based quantum circuits and their applications | 2004-09-22 | Paper |
| A new quantum claw-finding algorithm for three functions | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737165 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044355 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472492 | 2004-08-04 | Paper |
| Approximability results for stable marriage problems with ties. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218139 | 2004-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437088 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427869 | 2003-09-14 | Paper |
| A family of NFAs which need 2\(^{n}-\alpha\) deterministic states | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708583 | 2003-06-18 | Paper |
| A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs | 2003-03-17 | Paper |
| Online independent sets. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785576 | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551342 | 2002-09-05 | Paper |
| Complexity of finding dense subgraphs | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548298 | 2002-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548314 | 2002-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548799 | 2002-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766829 | 2002-07-22 | Paper |
| Hard variants of stable marriage. | 2002-07-15 | Paper |
| An O(N) Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size | 2002-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536379 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331308 | 2002-05-15 | Paper |
| New Bounds for Oblivious Mesh Routing | 2002-01-07 | Paper |
| A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes | 2001-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2743804 | 2001-09-17 | Paper |
| Efficient randomized routing algorithms on the two-dimensional mesh of buses | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761867 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525738 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511222 | 2000-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505369 | 2000-09-27 | Paper |
| Greedily Finding a Dense Subgraph | 2000-08-28 | Paper |
| Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs | 2000-06-04 | Paper |
| Oblivious routing algorithms on the mesh of buses | 2000-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252322 | 2000-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938640 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937847 | 2000-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937861 | 2000-02-20 | Paper |
| A representation method of assembly tasks for dealing with uncertainty | 2000-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937193 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937195 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937224 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937225 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937228 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699307 | 2000-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703468 | 1999-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703852 | 1999-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703864 | 1999-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253321 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253337 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218132 | 1999-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218425 | 1998-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375762 | 1998-10-01 | Paper |
| A canonical form of vector machines | 1998-09-01 | Paper |
| Better approximations of non-Hamiltonian graphs | 1998-06-02 | Paper |
| Exponential lower bounds for the tree-like Hajós calculus | 1997-02-28 | Paper |
| Time lower bounds do not exist for CRCW PRAMs | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5687264 | 1996-12-11 | Paper |
| Routing Problems on the Mesh of Buses | 1996-09-16 | Paper |
| Routing Problems on the Mesh of Buses | 1996-08-21 | Paper |
| A Simpler Parallel Algorithm for Graph Connectivity | 1994-10-19 | Paper |
| ${\text{ASPACE}}(o(\log \log n))$ is Regular | 1993-05-16 | Paper |
| CNF-Satisfiability Test by Counting and Polynomial Average Time | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785962 | 1987-01-01 | Paper |
| The universe problem for unrestricted flow languages | 1983-01-01 | Paper |
