Roberto Solis-Oba

Theor. Comput. Sci., 2025

2024

Endmember Analysis of Overlapping Handwritten Text in Hyperspectral Document Images.

[BibT_eX]

[DOI]

IEEE Access, 2024

The Thief Orienteering Problem on Series-Parallel Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024

2023

A local search approximation algorithm for the multiway cut problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., October, 2023

A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2022

High Multiplicity Strip Packing with Three Rectangle Types.

[BibT_eX]

[DOI]

Andy Yu

Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

2021

New Algorithms for Computing Field of Vision over 2D Grids.

[BibT_eX]

[DOI]

Evan R. M. Debenham

CoRR, 2021

Simple and Efficient Algorithm for Drone Path Planning.

[BibT_eX]

[DOI]

Proceedings of the ICC 2021, 2021

Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments.

[BibT_eX]

[DOI]

Marten Maack

Theor. Comput. Sci., 2020

Makespan minimization on unrelated parallel machines with a few bags.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Structural parameters for scheduling with assignment restrictions.

[BibT_eX]

[DOI]

Marten Maack

Theor. Comput. Sci., 2020

2019

Guest Editorial: Special Issue on Approximation and Online Algorithms.

[BibT_eX]

[DOI]

Rudolf Fleischer

Theory Comput. Syst., 2019

Approximation algorithms for the graph balancing problem with two speeds and two job lengths.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

2018

A local search algorithm for the constrained max cut problem on hypergraphs.

[BibT_eX]

[DOI]

PeerJ Prepr., 2018

Labeling Mycielski Graphs with a Condition at Distance Two.

[BibT_eX]

Ars Comb., 2018

Labeling Total Graphs with a Condition at Distance Two.

[BibT_eX]

Ars Comb., 2018

Local Search.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

L(2, 1)-Labeling of Kneser graphs and coloring squares of Kneser graphs.

[BibT_eX]

[DOI]

Igor Averbakh

Discret. Appl. Math., 2017

A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves.

[BibT_eX]

[DOI]

Paul S. Bonsma

Stefanie Lowski

Algorithmica, 2017

2016

A New Characterization of Disk Graphs and its Application.

[BibT_eX]

Ars Comb., 2016

On some results for the L(2, 1)-labeling on Cartesian sum graphs.

[BibT_eX]

Ars Comb., 2016

A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights.

[BibT_eX]

[DOI]

Algorithms, 2016

2015

Special Issue on Approximation and Online Algorithms.

[BibT_eX]

[DOI]

Giuseppe Persiano

Theory Comput. Syst., 2015

Analysis of a local search algorithm for the k-facility location problem.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2015

2014

SAGE: String-overlap Assembly of GEnomes.

[BibT_eX]

[DOI]

BMC Bioinform., 2014

2013

L(2, 1)L(2, 1)-labelings on the modular product of two graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

2012

Packing Squares with Profits.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

2011

A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths.

[BibT_eX]

[DOI]

Math. Oper. Res., 2011

A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

2010

L(2, 1)-Labelings on the composition of n graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Approximation Schemes for Scheduling Jobs with Chain Precedence Constraints.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2010

An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Improvements on Existing Search Engines through Categorization.

[BibT_eX]

Guo Mei

Proceedings of the 2010 International Conference on Internet Computing, 2010

2009

Rectangle packing with one-dimensional resource augmentation.

[BibT_eX]

[DOI]

Discret. Optim., 2009

Improving the Performance of Online Mapping Applications with Prefetching.

[BibT_eX]

Qinghui Liu

Proceedings of the 2009 International Conference on Internet Computing, 2009

2008

On Packing Rectangles with Resource Augmentation: Maximizing the Profit.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2008

A Polynomial Time Approximation Scheme for the Square Packing Problem.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

Web Prefetching with Machine Learning Algorithms.

[BibT_eX]

Qinghui Liu

Proceedings of the 2008 International Conference on Internet Computing, 2008

2007

Local Search.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

New Approximability Results for 2-Dimensional Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

Approximation Algorithms for the k-Median Problem.

[BibT_eX]

[DOI]

Proceedings of the Efficient Approximation and Online Algorithms, 2006

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Efficient algorithms for robustness in resource allocation and scheduling problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

An asymptotic approximation algorithm for 3D-strip packing.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Gene Assembly Algorithms for Ciliates.

[BibT_eX]

[DOI]

Lucian Ilie

Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

2005

Approximation algorithms for flexible job shop problems.

[BibT_eX]

[DOI]

Monaldo Mastrolilli

Int. J. Found. Comput. Sci., 2005

Approximation schemes for job shop scheduling problems with controllable processing times.

[BibT_eX]

[DOI]

Monaldo Mastrolilli

Eur. J. Oper. Res., 2005

Packing Weighted Rectangles into a Square.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Reducing the Size of NFAs by Using Equivalences and Preorders.

[BibT_eX]

[DOI]

Lucian Ilie

Sheng Yu

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

On Packing Squares with Resource Augmentation: Maximizing the Profit.

[BibT_eX]

[DOI]

Proceedings of the Theory of Computing 2005, 2005

2003

An asymptotic fully polynomial time approximation scheme for bin covering.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Makespan Minimization in Job Shops: A Linear Time Approximation Scheme.

[BibT_eX]

[DOI]

Maxim Sviridenko

SIAM J. Discret. Math., 2003

A Framework for Designing Approximation Algorithms for Scheduling Problems.

[BibT_eX]

[DOI]

Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2003

2001

Approximation Algorithms for Bounded Facility Location Problems.

[BibT_eX]

[DOI]

Piotr Krysta

J. Comb. Optim., 2001

How Helpers Hasten h-Relations.

[BibT_eX]

[DOI]

Peter Sanders

J. Algorithms, 2001

Job Shop Scheduling Problems with Controllable Processing Times.

[BibT_eX]

[DOI]

Monaldo Mastrolilli

Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

2000

How Helpers Hasten h-Relations.

[BibT_eX]

[DOI]

Peter Sanders

Proceedings of the Algorithms, 2000

1999

Increasing the Weight of Minimum Spanning Trees.

[BibT_eX]

[DOI]

J. Algorithms, 1999

Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme.

[BibT_eX]

[DOI]

Maxim Sviridenko

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

A Linear Time Approximation Scheme for the Job Shop Scheduling Problem.

[BibT_eX]

[DOI]

Maxim Sviridenko

Proceedings of the Randomization, 1999

Approximation Algorithms for Bounded Facility Location.

[BibT_eX]

[DOI]

Piotr Krysta

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

Algorithms for Measuring Perturbability in Matroid Optimization.

[BibT_eX]

[DOI]

Comb., 1998

2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1998

1997

Robustness and approximation in combinatorial optimization

[BibT_eX]

[DOI]

PhD thesis, 1997

Efficient Algorithms for Robustness in Matroid Optimization.

[BibT_eX]

[DOI]