Anand Srivastav

Theory Comput. Syst., August, 2023

2022

Hemivariational inequalities on graphs.

[BibT_eX]

[DOI]

Comput. Appl. Math., June, 2022

A new bound for the Maker-Breaker triangle game.

[BibT_eX]

[DOI]

Christian Glazik

Eur. J. Comb., 2022

Algorithms for Big Data Problems in de Novo Genome Assembly.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

2021

Approximation algorithm for the multicovering problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

Bounds for the Static Permutation Mastermind game.

[BibT_eX]

[DOI]

Discret. Math., 2021

2020

Approximation of set multi-cover via hypergraph matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

A novel Hybrid Multi-objective Evolutionary Algorithm for the bi-Objective Minimum Diameter-Cost Spanning Tree (bi-MDCST) problem.

[BibT_eX]

[DOI]

Prem Prakash Vuppuluri

Eng. Appl. Artif. Intell., 2020

2018

On the Query Complexity of Black-Peg AB-Mastermind.

[BibT_eX]

[DOI]

Games, 2018

2017

Towards the right amount of randomness in quantum-inspired evolutionary algorithms.

[BibT_eX]

[DOI]

Soft Comput., 2017

Swap Equilibria under Link and Vertex Destruction.

[BibT_eX]

[DOI]

Elmira Shirazi Sheykhdarabadi

Games, 2017

Finding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM.

[BibT_eX]

[DOI]

Christian Glazik

Jan Schiemann

CoRR, 2017

An improved filtering algorithm for big read datasets and its application to single-cell assembly.

[BibT_eX]

[DOI]

BMC Bioinform., 2017

Bounds for Static Black-Peg AB Mastermind.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Parallel improved quantum inspired evolutionary algorithm to solve large size Quadratic Knapsack Problems.

[BibT_eX]

[DOI]

Swarm Evol. Comput., 2016

An approximation algorithm for the partial vertex cover problem in hypergraphs.

[BibT_eX]

[DOI]

Helena Fohlin

J. Comb. Optim., 2016

Finding Euler Tours in the StrSort Model.

[BibT_eX]

[DOI]

Jan Schiemann

CoRR, 2016

Randomized Approximation for the Set Multicover Problem in Hypergraphs.

[BibT_eX]

[DOI]

Peter Munstermann

Algorithmica, 2016

A Streaming Algorithm for the Undirected Longest Path Problem.

[BibT_eX]

[DOI]

Christian Schielke

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Quantum-Inspired Evolutionary Algorithm for difficult knapsack problems.

[BibT_eX]

[DOI]

Memetic Comput., 2015

Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2015

Solving the 0-1 Quadratic Knapsack Problem with a competitive Quantum Inspired Evolutionary Algorithm.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2015

Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem.

[BibT_eX]

[DOI]

Prem Prakash Vuppuluri

Informatica (Slovenia), 2015

Price of Anarchy for Graph Coloring Games with Concave Payoff.

[BibT_eX]

[DOI]

Elmira Shirazi Sheykhdarabadi

CoRR, 2015

2014

A randomised approximation algorithm for the hitting set problem.

[BibT_eX]

[DOI]

Helena Fohlin

Theor. Comput. Sci., 2014

Solution of "Hard" Knapsack Instances Using Quantum Inspired Evolutionary Algorithm.

[BibT_eX]

[DOI]

Int. J. Appl. Evol. Comput., 2014

Discrepancy of (centered) arithmetic progressions in ZpZp.

[BibT_eX]

[DOI]

Nils Hebbinghaus

Eur. J. Comb., 2014

2013

Deutsch-indische Kooperation im Algorithm Engineering.

[BibT_eX]

[DOI]

Inform. Spektrum, 2013

A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions.

[BibT_eX]

[DOI]

Ole Kliemann

Volkmar Sauerland

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

2012

Novel quantum-inspired evolutionary algorithms for the quadratic knapsack problem.

[BibT_eX]

[DOI]

Prem Prakash Vuppuluri

Int. J. Math. Oper. Res., 2012

Bipartite Matching in the Semi-streaming Model.

[BibT_eX]

[DOI]

Algorithmica, 2012

A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs.

[BibT_eX]

[DOI]

Helena Fohlin

Proceedings of the Design and Analysis of Algorithms, 2012

2011

Discrepancy of Centered Arithmetic Progressions in Zp (Extended Abstract).

[BibT_eX]

[DOI]

Nils Hebbinghaus

Electron. Notes Discret. Math., 2011

Inapproximability of b-Matching in k-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Antje Fretwurst

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

2009

Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems.

[BibT_eX]

[DOI]

Michael Gnewuch

Carola Winzen

J. Complex., 2009

Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Bipartite Graph Matchings in the Semi-streaming Model.

[BibT_eX]

[DOI]

Sebastian Eggert

Proceedings of the Algorithms, 2009

Models of Non-atomic Congestion Games - From Unicast to Multicast Routing.

[BibT_eX]

[DOI]

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

Multicast Routing and Design of Sparse Connectors.

[BibT_eX]

[DOI]

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2007

Parallel Algorithms via the Probabilistic Method.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Probabilistic analysis for a multiple depot vehicle routing problem.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2007

On the minimum load coloring problem.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

Cubature formulas for function spaces with moderate smoothness.

[BibT_eX]

[DOI]

J. Complex., 2007

Enhanced Quantum Evolutionary Algorithms for Difficult Knapsack Problems.

[BibT_eX]

[DOI]

Apurva Narayan

Proceedings of the Pattern Recognition and Machine Intelligence, 2007

Fixed-point-coefficient FIR filters and filter banks: Improved design by randomized quantizations.

[BibT_eX]

[DOI]

Proceedings of the 9th International Symposium on Signal Processing and Its Applications, 2007

Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem.

[BibT_eX]

[DOI]

Sören Werth

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Solving Generalized Maximum Dispersion with Linear Programming.

[BibT_eX]

[DOI]

Katja Wolf

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

The Lovász-Local-Lemma and Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Efficient Approximation and Online Algorithms, 2006

The Price of Anarchy in Selfish Multicast Routing.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2005

Approximation algorithms for the Euclidean bipartite TSP.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2005

Constructions of sparse asymmetric connectors with number theoretic methods.

[BibT_eX]

[DOI]

Networks, 2005

Improved Approximation Algorithms for Maximum Graph Partitioning Problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2005

Bounds and constructions for the star-discrepancy via ?-covers.

[BibT_eX]

[DOI]

Michael Gnewuch

J. Complex., 2005

2004

Fast approximation of minimum multicast congestion - Implementation VERSUS Theory.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2004

Coloring Graphs with Minimal Edge Load.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

Ordered binary decision diagrams and the Shannon effect.

[BibT_eX]

[DOI]

Clemens Gröpl

Hans Jürgen Prömel

Discret. Appl. Math., 2004

Discrepancy of Cartesian Products of Arithmetic Progressions.

[BibT_eX]

[DOI]

Petra Wehr

Electron. J. Comb., 2004

2003

Multicolour Discrepancies.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

Constructions of Sparse Asymmetric Connectors: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002

On Constrained Hypergraph Coloring and Scheduling.

[BibT_eX]

[DOI]

Nitin Ahuja

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001

On the evolution of the worst-case OBDD size.

[BibT_eX]

[DOI]

Clemens Gröpl

Hans Jürgen Prömel

Inf. Process. Lett., 2001

Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Multi-Color Discrepancies - Extended Abstract -.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract).

[BibT_eX]

[DOI]

Tomasz Schoen

Electron. Notes Discret. Math., 2001

Approximation Algorithms for Pick-and-Place Robots.

[BibT_eX]

[DOI]

Hartmut Schroeter

Christoph Michel

Ann. Oper. Res., 2001

Recursive Randomized Coloring Beats Fair Dice Random Colorings.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation.

[BibT_eX]

[DOI]

Tomasz Schoen

Proceedings of the Approximation, 2001

2000

On Complexity, Representation and Approximation of Integral Multicommodity Flows.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

1999

Alternating TSP and Printed Circuit Board Assembly.

[BibT_eX]

[DOI]

Hartmut Schroeter

Christoph Michel

Electron. Notes Discret. Math., 1999

Approximation of Multi-color Discrepancy.

[BibT_eX]

[DOI]

Proceedings of the Randomization, 1999

Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets.

[BibT_eX]

[DOI]

Tomasz Schoen

Proceedings of the Randomization, 1999

1998

Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract).

[BibT_eX]

[DOI]

Clemens Gröpl

Hans Jürgen Prömel

Proceedings of the STACS 98, 1998

Blockwise Variable Orderings for Shared BDDs.

[BibT_eX]

[DOI]

Harry Preuß

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Finding Dense Subgraphs with Semidefinite Programming.

[BibT_eX]

[DOI]

Katja Wolf

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

1997

Tight Approximations for Resource Constrained Scheduling and Bin Packing.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

A Parallel Approximation Algorithm for Resource Constrained Scheduling and Bin Packing.

[BibT_eX]

[DOI]

Proceedings of the Solving Irregularly Structured Problems in Parallel, 1997

1996

Algorithmic Chernoff-Hoeffding inequalities in integer programming.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1996

1995

Weighted Fractional and Integral K-matching in Hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

1994

Algorthmic Chernoff-Hoeffding Inequalitiers in Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Tight Approximations for Resource Constrained Scheduling Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1994

1993

On Quadratic Lattice Approximations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Integer Multicommodity Flows with Reduced Demands.

[BibT_eX]

[DOI]