Frans Schalekamp

According to our database1, Frans Schalekamp authored at least 21 papers between 2008 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A duality based 2-approximation algorithm for maximum agreement forest.
Math. Program., March, 2023

2022
GILP: An Interactive Tool for Visualizing the Simplex Algorithm.
CoRR, 2022

2018
Layers and matroids for the traveling salesman's paths.
Oper. Res. Lett., 2018

2017
Minimizing worst-case and average-case makespan over scenarios.
J. Sched., 2017

2016
A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation.
Inf. Process. Lett., 2016

Flow-based scheme for time-constrained data gathering in wireless sensor networks.
Int. J. Wirel. Mob. Comput., 2016

Optimally Discriminative Choice Sets in Discrete Choice Models: Application to Data-Driven Test Design.
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Split scheduling with uniform setup times.
J. Sched., 2015

On the integrality gap of the subtour LP for the 1, 2-TSP.
Math. Program., 2015

2014
2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture.
Math. Oper. Res., 2014

Popular ranking.
Discret. Appl. Math., 2014

An Upper Bound on the Number of Circular Transpositions to Sort a Permutation.
CoRR, 2014

Scheduling over Scenarios on Two Machines.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013
Clustering with or without the approximation.
J. Comb. Optim., 2013

2012
On the Complexity of the Minimum Latency Scheduling Problem on the Euclidean Plane
CoRR, 2012

Brief announcement: on the complexity of the minimum latency scheduling problem on the euclidean plane.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

A proof of the Boyd-Carr conjecture.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
On the Integrality Gap of the Subtour LP for the 1,2-TSP
CoRR, 2011

2009
Rank Aggregation: Together We're Strong.
Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008
Algorithms for the universal and a priori TSP.
Oper. Res. Lett., 2008


  Loading...