Cid C. de Souza

97 papers A* 1A 1B 4C 12Misc 2Journal 59Unranked 17
YearRankTypeTitle / Venue / Authors
2026 J jnl
Fair age prediction through ILP-based multi-attribute training subset selection.
Appl. Soft Comput.
Ana Paula dos Santos Dantas, Gabriel Bianchin de Oliveira, Hélio Pedrini, Cid C. de Souza, Zanoni Dias
2024 J jnl
Exact and heuristic solutions for the prize-collecting geometric enclosure problem.
Int. Trans. Oper. Res.
Natanael Ramos, Rafael G. Cano, Pedro J. de Rezende, Cid C. de Souza
2023 — conf
Algorithmic Fairness Applied to the Multi-Label Classification Problem.
VISIGRAPP (5: VISAPP)
Ana Paula dos Santos Dantas, Gabriel Bianchin de Oliveira, Daiane Mendes de Oliveira, Hélio Pedrini, Cid C. de Souza, Zanoni Dias
2023 J jnl
Scalable timing-aware network design via lagrangian decomposition.
Eur. J. Oper. Res.
Cristiana L. Lara, Jochen Könemann, Yisu Nie, Cid C. de Souza
2023 — conf
The Multi-attribute Fairer Cover Problem.
BRACIS (1)
Ana Paula dos Santos Dantas, Gabriel Bianchin de Oliveira, Hélio Pedrini, Cid C. de Souza, Zanoni Dias
2022 J jnl
A heuristic for the convex recoloring problem in graphs.
Int. Trans. Oper. Res.
Ana Paula dos Santos Dantas, Cid C. de Souza, Zanoni Dias
2022 J jnl
Algorithms for the Maximum Eulerian Cycle Decomposition Problem.
CoRR
Pedro Olímpio Pinheiro, Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Cid C. de Souza, Zanoni Dias
2022 J jnl
Optimal area polygonization problems: Exact solutions through geometric duality.
Comput. Oper. Res.
Natanael Ramos, Pedro J. de Rezende, Cid C. de Souza
2022 J jnl
Triangle-Based Heuristics for Area Optimal Polygonizations.
ACM J. Exp. Algorithmics
Natanael Ramos, Raí C. de Jesus, Pedro J. de Rezende, Cid C. de Souza, Fábio Luiz Usberti
2021 — conf
Convex Bichromatic Quadrangulation of Point Sets with Minimum Color Flips.
CCCG
Allan Sapucaia, André A. Ciré, Pedro J. de Rezende, Cid C. de Souza
2021 C conf
Effective Heuristics for the Perfect Awareness Problem.
LAGOS
Felipe de Carvalho Pereira, Pedro J. de Rezende, Cid C. de Souza
2021 — conf
Solving the Coarseness Problem by ILP Using Column Generation.
ICCSA (5)
Allan Sapucaia, Pedro J. de Rezende, Cid C. de Souza
2021 J jnl
Solving the minimum convex partition of point sets with integer programming.
Comput. Geom.
Allan Sapucaia, Pedro J. de Rezende, Cid C. de Souza
2020 J jnl
Solving the Minimum Convex Partition of Point Sets with Integer Programming.
CoRR
Allan Sapucaia, Pedro J. de Rezende, Cid C. de Souza
2019 C conf
Minimum Convex Partition of Point Sets.
CIAC
Allan S. Barboza, Cid C. de Souza, Pedro J. de Rezende
2019 J jnl
Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax-and-fix heuristic.
Int. Trans. Oper. Res.
Celso C. Ribeiro, Tiago de A. Santos, Cid C. de Souza
2019 J jnl
Solving dynamic labeling problems to optimality using solution space reductions.
Theor. Comput. Sci.
Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende
2019 J jnl
Solving the geometric firefighter routing problem via integer programming.
Eur. J. Oper. Res.
Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza
2018 J jnl
Finding exact solutions for the Geometric Firefighter Problem in practice.
Comput. Oper. Res.
Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza
2018 — conf
Optimal Solutions for a Geometric Knapsack Problem using Integer Programming.
CCCG
Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende
2017 B conf
Fast Optimal Labelings for Rotating Maps.
WALCOM
Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende
2017 J jnl
Minimum stabbing rectangular partitions of rectilinear polygons.
Comput. Oper. Res.
Breno Piva, Cid C. de Souza
2016 J jnl
Algorithm 966: A Practical Iterative Algorithm for the Art Gallery Problem Using Integer Linear Programming.
ACM Trans. Math. Softw.
Davi C. Tozoni, Pedro J. de Rezende, Cid C. de Souza
2016 — ch.
Engineering Art Galleries.
Algorithm Engineering
Pedro J. de Rezende, Cid C. de Souza, Stephan Friedrichs, Michael Hemmer, Alexander Kröller, Davi C. Tozoni
2016 — conf
Exact Solutions for the Geometric Firefighter Problem.
CCCG
Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza
2016 J jnl
Lower bounds for large traveling umpire instances: New valid inequalities and a branch-and-cut algorithm.
Comput. Oper. Res.
Lucas de Oliveira, Cid C. de Souza, Tallys H. Yunes
2016 J jnl
Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph.
Discret. Optim.
Agostinho Agra, Mahdi Doostmohammadi, Cid C. de Souza
2015 J jnl
Arc-based integer programming formulations for three variants of proportional symbol maps.
Discret. Optim.
Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende, Tallys H. Yunes
2015 C conf
Computing Bounds for Eternal Domination.
CTW
Andrei Braga, Cid C. de Souza, Orlando Lee
2015 Misc conf
Computing Minimum Dilation Spanning Trees in Geometric Graphs.
COCOON
Aléx F. Brandt, Miguel F. A. de Gaiowski, Pedro J. de Rezende, Cid C. de Souza
2015 J jnl
Counterexample for the 2-approximation of finding partitions of rectilinear polygons with minimum stabbing number.
CoRR
Breno Piva, Cid C. de Souza
2015 J jnl
On the complexity of the traveling umpire problem.
Theor. Comput. Sci.
Lucas de Oliveira, Cid C. de Souza, Tallys H. Yunes
2015 J jnl
Partitions of Rectilinear Polygons with Minimum Stabbing Number.
Electron. Notes Discret. Math.
Breno Piva, Cid C. de Souza
2015 J jnl
Solving the natural wireless localization problem to optimality efficiently.
Comput. Geom.
Bruno E. Crepaldi, Pedro J. de Rezende, Cid C. de Souza
2015 J jnl
The Eternal Dominating Set problem for proper interval graphs.
Inf. Process. Lett.
Andrei Braga, Cid C. de Souza, Orlando Lee
2014 B conf
An Exact Algorithm for the Discrete Chromatic Art Gallery Problem.
SEA
Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza
2014 C conf
An Integer Programming Formulation for the Maximum k-Subset Intersection Problem.
ISCO
Eduardo T. Bogue, Cid C. de Souza, Eduardo C. Xavier, Alexandre S. Freire
2014 J jnl
Engineering Art Galleries.
CoRR
Pedro Jussieu de Rezende, Cid C. de Souza, Stephan Friedrichs, Michael Hemmer, Alexander Kröller, Davi C. Tozoni
2014 J jnl
Improved bounds for the traveling umpire problem: A stronger formulation and a relax-and-fix heuristic.
Eur. J. Oper. Res.
Lucas de Oliveira, Cid C. de Souza, Tallys H. Yunes
2014 J jnl
Integer programming approaches for minimum stabbing problems.
RAIRO Oper. Res.
Breno Piva, Cid C. de Souza, Yuri Frota, Luidi Simonetti
2014 — conf
Minimum Dilation Triangulation: Reaching Optimality Efficiently.
CCCG
Aléx F. Brandt, Miguel M. Gaiowski, Cid C. de Souza, Pedro J. de Rezende
2014 J jnl
Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation.
INFORMS J. Comput.
Guilherme Kunigami, Pedro J. de Rezende, Cid C. de Souza, Tallys H. Yunes
2013 J jnl
A hybrid GRASP heuristic to construct effective drawings of proportional symbol maps.
Comput. Oper. Res.
Rafael G. Cano, Guilherme Kunigami, Cid C. de Souza, Pedro J. de Rezende
2013 — conf
An Efficient Exact Algorithm for the Natural Wireless Localization Problem.
CCCG
Bruno E. Crepaldi, Pedro J. de Rezende, Cid C. de Souza
2013 J jnl
Arc-based integer programming formulations for three variants of proportional symbol maps.
Electron. Notes Discret. Math.
Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende, Tallys H. Yunes
2013 A* conf
Point guards and point clouds: solving general art gallery problems.
SoCG
Dorit Borrmann, Pedro J. de Rezende, Cid C. de Souza, Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller, Andreas Nüchter, Christiane Schmidt, Davi C. Tozoni
2013 B conf
The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm.
SEA
Davi C. Tozoni, Pedro J. de Rezende, Cid C. de Souza
2012 J jnl
A branch-and-cut-and-price approach for the capacitated m-ring-star problem.
Discret. Appl. Math.
Edna Ayako Hoshino, Cid C. de Souza
2012 J jnl
Generating optimal drawings of physically realizable symbol maps with integer programming.
Vis. Comput.
Guilherme Kunigami, Pedro J. de Rezende, Cid C. de Souza, Tallys H. Yunes
2012 J jnl
Planning the operation of a large real-world oil pipeline.
Comput. Chem. Eng.
Tony Minoru Tamura Lopes, Arnaldo Vieira Moura, Cid C. de Souza, André A. Ciré
2012 C conf
The Minimum Stabbing Triangulation Problem: IP Models and Computational Evaluation.
ISCO
Breno Piva, Cid C. de Souza
2012 J jnl
The maximum common edge subgraph problem: A polyhedral investigation.
Discret. Appl. Math.
Laura Bahiense, Gordana Manic, Breno Piva, Cid C. de Souza
2011 J jnl
A branch-and-price approach for the partition coloring problem.
Oper. Res. Lett.
Edna Ayako Hoshino, Yuri Frota, Cid C. de Souza
2011 J jnl
An exact algorithm for minimizing vertex guards on art galleries.
Int. Trans. Oper. Res.
Marcelo C. Couto, Pedro J. de Rezende, Cid C. de Souza
2011 J jnl
An exact approach to the problem of extracting an embedded network matrix.
Comput. Oper. Res.
Rosa M. V. Figueiredo, Martine Labbé, Cid C. de Souza
2011 C conf
Effective drawing of proportional symbol maps using GRASP.
CTW
Rafael G. Cano, Guilherme Kunigami, Cid C. de Souza, Pedro J. de Rezende
2011 J jnl
Exact algorithms for the vertex separator problem in graphs.
Networks
Cid C. de Souza, Victor F. Cavalcante
2011 B conf
Experimental Evaluation of Algorithms for the Orthogonal Milling Problem with Turn Costs.
SEA
Igor R. de Assis, Cid C. de Souza
2011 J jnl
New branch-and-bound algorithms for k-cardinality tree problems.
Electron. Notes Discret. Math.
Luidi Simonetti, Fábio Protti, Yuri Frota, Cid C. de Souza
2011 — conf
Optimizing the Layout of Proportional Symbol Maps.
ICCSA (3)
Guilherme Kunigami, Pedro Jussieu de Rezende, Cid C. de Souza, Tallys H. Yunes
2011 J jnl
The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm.
Discret. Appl. Math.
Luidi Simonetti, Yuri Frota, Cid C. de Souza
2009 C conf
A Branch-and-Price Approach for the Partition Coloring Problem.
CTW
Edna Ayako Hoshino, Yuri Frota, Cid C. de Souza
2009 J jnl
A branch&cut algorithm for the maximum common edge subgraph problem.
Electron. Notes Discret. Math.
Gordana Manic, Laura Bahiense, Cid C. de Souza
2009 C conf
An Exact Method for the Minimum Caterpillar Spanning Problem.
CTW
Luidi Simonetti, Yuri Frota, Cid C. de Souza
2009 — conf
An IP solution to the art gallery problem.
SCG
Marcelo C. Couto, Pedro Jussieu de Rezende, Cid C. de Souza
2009 J jnl
Upper and lower bounding procedures for the minimum caterpillar spanning problem.
Electron. Notes Discret. Math.
Luidi Simonetti, Yuri Frota, Cid C. de Souza
2008 J jnl
A Relax-and-Cut algorithm for the set partitioning problem.
Comput. Oper. Res.
Victor F. Cavalcante, Cid C. de Souza, Abilio Lucena
2008 J jnl
Acyclic Orientations with Path Constraints.
RAIRO Oper. Res.
Rosa M. V. Figueiredo, Valmir Carneiro Barbosa, Nelson Maculan, Cid C. de Souza
2008 C conf
Column Generation Algorithms for the Capacitated
CTW
Edna Ayako Hoshino, Cid C. de Souza
2008 Misc conf
Column Generation Algorithms for the Capacitated m-Ring-Star Problem.
COCOON
Edna Ayako Hoshino, Cid C. de Souza
2008 C conf
Exact Algorithms for the Vertex Separator Problem in Graphs.
CTW
Victor F. Cavalcante, Cid C. de Souza
2008 — conf
Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem.
WEA
Marcelo C. Couto, Cid C. de Souza, Pedro Jussieu de Rezende
2008 — conf
Heuristics and Constraint Programming Hybridizations for a Real Pipeline Planning and Scheduling Problem.
CSE
Arnaldo Vieira Moura, Cid C. de Souza, André A. Ciré, Tony Minoru Tamura Lopes
2008 C conf
On the Facial Structure of the Common Edge Subgraph polytope.
CTW
Gordana Manic, Laura Bahiense, Cid C. de Souza
2008 A conf
Planning and Scheduling the Operation of a Very Large Oil Pipeline Network.
CP
Arnaldo Vieira Moura, Cid C. de Souza, André A. Ciré, Tony Minoru Tamura Lopes
2008 J jnl
Scheduling activities at oil wells with resource displacement.
Int. Trans. Oper. Res.
Arnaldo Vieira Moura, Romulo A. Pereira, Cid C. de Souza
2007 — conf
An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem.
SIBGRAPI
Marcelo C. Couto, Cid C. de Souza, Pedro Jussieu de Rezende
2007 — conf
Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem.
ESCAPE
Victor F. Cavalcante, Cid C. de Souza
2006 J jnl
A column generation approach for SONET ring assignment.
Networks
Elder M. Macambira, Nelson Maculan, Cid C. de Souza
2006 J jnl
Multiprocessor scheduling under precedence constraints: Polyhedral results.
Discret. Appl. Math.
Pablo E. Coll, Celso C. Ribeiro, Cid C. de Souza
2006 J jnl
Vehicle and crew scheduling for urban bus lines.
Eur. J. Oper. Res.
Maikol M. Rodrigues, Cid C. de Souza, Arnaldo Vieira Moura
2005 J jnl
A note on characterizing canonical cuts using geometry.
Int. Trans. Oper. Res.
Elder M. Macambira, Nelson Maculan, Cid C. de Souza
2005 J jnl
Acyclic orientations with path constraints
CoRR
Rosa M. V. Figueiredo, Valmir Carneiro Barbosa, Nelson Maculan, Cid C. de Souza
2005 — conf
Comparative Experiments with GRASP and Constraint Programming for the Oil Well Drilling Problem.
WEA
Romulo A. Pereira, Arnaldo Vieira Moura, Cid C. de Souza
2005 J jnl
Efficient datapath merging for partially reconfigurable architectures.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Nahri Moreano, Edson Borin, Cid C. de Souza, Guido Araujo
2005 J jnl
Hybrid Column Generation Approaches for Urban Transit Crew Management Problems.
Transp. Sci.
Tallys H. Yunes, Arnaldo Vieira Moura, Cid C. de Souza
2005 J jnl
The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation.
ACM J. Exp. Algorithmics
Cid C. de Souza, André M. Lima, Guido Araujo, Nahri Moreano
2005 J jnl
The vertex separator problem: a polyhedral investigation.
Math. Program.
Egon Balas, Cid C. de Souza
2005 J jnl
The vertex separator problem: algorithms and computations.
Math. Program.
Cid C. de Souza, Egon Balas
2004 — conf
The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation.
WEA
Cid C. de Souza, André M. Lima, Nahri Moreano, Guido Araujo
2003 J jnl
Optimal rectangular partitions.
Networks
Felipe C. Calheiros, Abilio Lucena, Cid C. de Souza
2000 C conf
A Hybrid Approach for Solving Large Scale Crew Scheduling Problems.
PADL
Tallys H. Yunes, Arnaldo Vieira Moura, Cid C. de Souza
2000 J jnl
Exact Solutions of Rectangular Partitions via Integer Programming.
Int. J. Comput. Geom. Appl.
Cláudio Nogueira de Meneses, Cid C. de Souza
2000 J jnl
Scheduling under Labour Resource Constraints.
Constraints An Int. J.
Susanne Heipcke, Yves Colombani, Cristina C. B. Cavalcante, Cid C. de Souza
2000 — conf
Solving Very Large Crew Scheduling Problems to Optimality.
SAC (1)
Tallys H. Yunes, Arnaldo Vieira Moura, Cid C. de Souza
1998 J jnl
Static output feedback controllers: stability and convexity.
IEEE Trans. Autom. Control.
José Claudio Geromel, Cid C. de Souza, Robert E. Skelton
1995 J jnl
Some New Classes of Facets for the Equicut Polytope.
Discret. Appl. Math.
Cid C. de Souza, Monique Laurent