José A. Soto

Orcid: 0000-0003-2219-8401

Affiliations:
  • University of Chile, Santiago, Chile


According to our database1, José A. Soto authored at least 28 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Online Combinatorial Assignment in Independence Systems.
CoRR, 2023

2022
The Two-Sided Game of Googol.
J. Mach. Learn. Res., 2022

2021
Strong Algorithms for the Ordinal Matroid Secretary Problem.
Math. Oper. Res., 2021

Independent Sets and Hitting Sets of Bicolored Rectangular Families.
Algorithmica, 2021

Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle.
Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

The Multiple Traveling Salesman Problem on Spiders.
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

2020
Symmetry Exploitation for Online Machine Covering with Bounded Migration.
ACM Trans. Algorithms, 2020

Sample-driven optimal stopping: From the secretary problem to the i.i.d. prophet inequality.
CoRR, 2020

The Two-Sided Game of Googol and Sample-Based Prophet Inequalities.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design.
Algorithmica, 2019

The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Robust Randomized Matchings.
Math. Oper. Res., 2018

2015
Improved Analysis of a Max-Cut Algorithm Based on Spectral Partitioning.
SIAM J. Discret. Math., 2015

TSP Tours in Cubic Graphs: Beyond 4/3.
SIAM J. Discret. Math., 2015

Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line: Algorithms and Complexity.
Discret. Comput. Geom., 2015

Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays.
Comb. Probab. Comput., 2015

On Guillotine Cutting Sequences.
Proceedings of the Approximation, 2015

2014
Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013
Algorithms for Symmetric Submodular Function Minimization under Hereditary Constraints and Generalizations.
SIAM J. Discret. Math., 2013

Matroid Secretary Problem in the Random-Assignment Model.
SIAM J. Comput., 2013

Advances on Matroid Secretary Problems: Free Order Model and Laminar Case.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2011
A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids.
Electron. Notes Discret. Math., 2011

Generalizations and Variants of the Largest Non-crossing Matching Problem in Random Bipartite Graphs
CoRR, 2011

Jump Number of Two-Directional Orthogonal Ray Graphs.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010
Symmetric Submodular Function Minimization Under Hereditary Family Constraints
CoRR, 2010

2009
On a Speculated Relation Between Chvátal-Sankoff Constants of Several Sequences.
Comb. Probab. Comput., 2009

2008
Block transitivity and degree matrices.
Eur. J. Comb., 2008

2007
Block transitivity and degree matrices: (Extended abstract).
Electron. Notes Discret. Math., 2007


  Loading...