Cid C. de Souza
Orcid: 0000-0002-5945-0845Affiliations:
- Institute of Computing, University of Campinas, Brazil
According to our database1,
Cid C. de Souza
authored at least 107 papers
between 1993 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1995
2000
2005
2010
2015
2020
0
5
10
1
2
1
4
1
1
3
1
1
3
6
4
2
5
6
2
2
3
3
6
1
1
1
3
1
2
1
1
1
2
3
1
2
1
1
1
2
3
3
1
4
2
6
2
1
1
2
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
Int. Trans. Oper. Res., July, 2024
Int. Trans. Oper. Res., January, 2024
2023
Eur. J. Oper. Res., August, 2023
Proceedings of the 18th International Joint Conference on Computer Vision, 2023
Proceedings of the Intelligent Systems - 12th Brazilian Conference, 2023
2022
ACM J. Exp. Algorithmics, 2022
Int. Trans. Oper. Res., 2022
Comput. Oper. Res., 2022
2021
Comput. Geom., 2021
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021
Proceedings of the Computational Science and Its Applications - ICCSA 2021, 2021
Convex Bichromatic Quadrangulation of Point Sets with Minimum Color Flips.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021
2020
Heuristics for Breakpoint Graph Decomposition with Applications in Genome Rearrangement Problems.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2020
2019
Theor. Comput. Sci., 2019
Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax-and-fix heuristic.
Int. Trans. Oper. Res., 2019
Eur. J. Oper. Res., 2019
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019
2018
Comput. Oper. Res., 2018
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018
2017
Comput. Oper. Res., 2017
Proceedings of the WALCOM: Algorithms and Computation, 2017
2016
Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016
Algorithm 966: A Practical Iterative Algorithm for the Art Gallery Problem Using Integer Linear Programming.
ACM Trans. Math. Softw., 2016
Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph.
Discret. Optim., 2016
Lower bounds for large traveling umpire instances: New valid inequalities and a branch-and-cut algorithm.
Comput. Oper. Res., 2016
Exact Solutions for the Geometric Firefighter Problem.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016
2015
Inf. Process. Lett., 2015
Electron. Notes Discret. Math., 2015
Arc-based integer programming formulations for three variants of proportional symbol maps.
Discret. Optim., 2015
Counterexample for the 2-approximation of finding partitions of rectilinear polygons with minimum stabbing number.
CoRR, 2015
Comput. Geom., 2015
Computing Bounds for Eternal Domination.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015
2014
INFORMS J. Comput., 2014
Improved bounds for the traveling umpire problem: A stronger formulation and a relax-and-fix heuristic.
Eur. J. Oper. Res., 2014
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
2013
Electron. Notes Discret. Math., 2013
A hybrid GRASP heuristic to construct effective drawings of proportional symbol maps.
Comput. Oper. Res., 2013
The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013
Proceedings of the Symposium on Computational Geometry 2013, 2013
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013
2012
Generating optimal drawings of physically realizable symbol maps with integer programming.
Vis. Comput., 2012
Discret. Appl. Math., 2012
Discret. Appl. Math., 2012
Ann. Oper. Res., 2012
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
2011
Oper. Res. Lett., 2011
Int. Trans. Oper. Res., 2011
Electron. Notes Discret. Math., 2011
The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm.
Discret. Appl. Math., 2011
Comput. Oper. Res., 2011
Experimental Evaluation of Algorithms for the Orthogonal Milling Problem with Turn Costs.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011
Proceedings of the 24th SIBGRAPI Conference on Graphics, 2011
Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
2010
Electron. Notes Discret. Math., 2010
Constraints An Int. J., 2010
2009
Electron. Notes Discret. Math., 2009
Electron. Notes Discret. Math., 2009
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009
2008
Int. Trans. Oper. Res., 2008
Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008
Heuristics and Constraint Programming Hybridizations for a Real Pipeline Planning and Scheduling Problem.
Proceedings of the 11th IEEE International Conference on Computational Science and Engineering, 2008
Proceedings of the Principles and Practice of Constraint Programming, 2008
On the Facial Structure of the Common Edge Subgraph polytope.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008
Column Generation Algorithms for the Capacitated <i>m</i>-Ring-Star Problem.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008
2007
Proceedings of the SIBGRAPI 2007, 2007
Proceedings of the Combinatorics, 2007
2006
Discret. Appl. Math., 2006
2005
Transp. Sci., 2005
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2005
The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation.
ACM J. Exp. Algorithmics, 2005
Comparative Experiments with GRASP and Constraint Programming for the Oil Well Drilling Problem.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005
2004
The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004
2003
2002
Discret. Appl. Math., 2002
2001
2000
Int. J. Comput. Geom. Appl., 2000
The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations.
Eur. J. Oper. Res., 2000
Proceedings of the Applied Computing 2000, 2000
Proceedings of the Practical Aspects of Declarative Languages, 2000
1999
RAIRO Oper. Res., 1999
1998
IEEE Trans. Autom. Control., 1998
Math. Program., 1998
1996
Formulations and valid inequalities for the node capacitated graph partitioning problem.
Math. Program., 1996
1995
1993
Heuristics for the Minimum Rectilinear Steiner Tree Problem: New Algorithms and a Computational Study.
Discret. Appl. Math., 1993