 | Up a level |
Collaboration networkThis graph maps the connections between all the collaborators of {}'s publications listed on this page.
Each link represents a collaboration on the same publication. The thickness of the link represents the number of collaborations.
Use the mouse wheel or scroll gestures to zoom into the graph.
You can click on the nodes and links to highlight them and move the nodes by dragging them.
Hold down the "Ctrl" key or the "⌘" key while clicking on the nodes to open the list of this person's publications.
Word cloudA word cloud is a visual representation of the most frequently used words in a text or a set of texts. The words appear in different sizes, with the size of each word being proportional to its frequency of occurrence in the text. The more frequently a word is used, the larger it appears in the word cloud. This technique allows for a quick visualization of the most important themes and concepts in a text.
In the context of this page, the word cloud was generated from the publications of the author {}. The words in this cloud come from the titles, abstracts, and keywords of the author's articles and research papers. By analyzing this word cloud, you can get an overview of the most recurring and significant topics and research areas in the author's work.
The word cloud is a useful tool for identifying trends and main themes in a corpus of texts, thus facilitating the understanding and analysis of content in a visual and intuitive way.
Coelho, E. P. R., Alves, R. J. M., Paiva, M. H. M., Rocha, H. R. O., Caporossi, G., & Segatto, M. E. V. (2022). Topological multi-contingency screening based on current flow betweenness. Electric Power Systems Research, 203, 107609. External link
Audet, C., Caporossi, G., & Jacquet, S. (2020). Binary, unrelaxable and hidden constraints in blackbox optimization. Operations Research Letters, 48(4), 467-471. External link
Audet, C., Caporossi, G., & Jacquet, S. (2020). Constraint scaling in the mesh adaptive direct search algorithm. Pacific Journal of Optimization, 16, 595-610. External link
Frascolla, V., Dominicini, C. K., Paiva, M. H. M., Caporossi, G., Marotta, M. A., Ribeiro, M. R. N., Segatto, M. E. V., Martinello, M., Monteiro, M. E., & Both, C. B. (2019). Optimizing C-RAN Backhaul Topologies: A Resilience-Oriented Approach Using Graph Invariants. Applied Sciences, 9(1), 136 (17 pages). Available
Inaba, F. K., Teatini Salles, E. O., Perron, S., & Caporossi, G. (2018). DGR-ELM-distributed generalized regularized ELM for classification. Neurocomputing, 275, 1522-1530. External link
Hansen, P., Aouchiche, M., Caporossi, G., Hertz, A., & Sellal, C. (2018). Mixed integer programming and extremal chemical graphs. International Journal of Chemistry and Chemical Engineering Systems, 3, 22-30. External link
Hansen, P., Hertz, A., Sellal, C., Vukičević, D., Aouchiche, M., & Caporossi, G. (2017). Edge realizability of connected simple graphs. Match-Communications in Mathematical and in Computer Chemistry, 78(3), 689-712. External link
Altinakar, S., Caporossi, G., & Hertz, A. (2017). Symmetry breaking constraints for the minimum deficiency problem. Journal of Graph Algorithms and Applications, 21(2), 195-218. External link
Neveu, F., Bécotte-Boutin, H.-S., Caporossi, G., Hertz, A., Leblay, C., Bergounioux, G., Côté, M. H., Fournier, J. M., Hriba, L., & Prévost, S. (2016). Analyse automatique des données scripturales prétraitées par des outils de visualization. SHS Web of Conferences, 27, 06001 (18 pages). Available
Altinakar, S., Caporossi, G., & Hertz, A. (2016). A comparison of integer and constraint programming models for the deficiency problem. Computers & Operations Research, 68, 89-96. External link
Altinakar, S., Caporossi, G., & Hertz, A. (2011). On compact k-edge-colorings: A polynomial time reduction from linear to cyclic. Discrete Optimization, 8(3), 502-512. External link
Aloise, D., Cafieri, S., Caporossi, G., Hansen, P., Perron, S., & Liberti, L. (2010). Column generation algorithms for exact modularity maximization in networks. Physical Review E, 82(4), 046112 (9 pages). External link
Caporossi, G., & Hansen, P. (2000). Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system. Discrete Mathematics, 212(1-2), 29-44. External link
Hansen, P., & Caporossi, G. (2000). AutoGraphiX: An Automated System for Finding Conjectures in Graph Theory. Electronic Notes in Discrete Mathematics, 5, 158-161. External link
Gutman, I., Miljkovic, O., Caporossi, G., & Hansen, P. (1999). Alkanes with small and large Randić connectivity indices. Chemical Physics Letters, 306(5-6), 366-372. External link
Caporossi, G., Cvetković, D., Gutman, I., & Hansen, P. (1999). Variable Neighborhood Search for Extremal Graphs. 2. Finding Graphs with Extremal Energy. Journal of Chemical Information and Computer Sciences, 39(6), 984-996. External link
Caporossi, G., Gutman, I., & Hansen, P. (1999). Variable neighborhood search for extremal graphs: IV: Chemical trees with extremal connectivity index. Computers & Chemistry, 23(5), 469-477. External link
Caporossi, G., & Hansen, P. (1998). Enumeration of Polyhex Hydrocarbons to h = 21. Journal of Chemical Information and Computer Sciences, 38(4), 610-619. External link
Carichon, F., & Caporossi, G. (2023). An history of relevance in unsupervised summarization. (Technical Report n° G-2023-53). External link
Audet, C., Caporossi, G., & Jacquet, S. (2019). Binary, unrelaxable and hidden constraints in blackbox optimization. (Technical Report n° G-2019-76). External link
Audet, C., Caporossi, G., & Jacquet, S. (2019). Constraint scaling in the Mesh Adaptative Direct Search algorithm. (Technical Report n° G-2019-65). External link
Hansen, P., Hertz, A., Sellal, C., Vukičević, D., Aouchiche, M., & Caporossi, G. (2017). Edge realizability of connected simple graphs. (Technical Report n° G-2017-10). External link
Altinakar, S., Caporossi, G., & Hertz, A. (2016). Symmetry breaking constraints for the minimum deficiency problem. (Technical Report n° G-2016-11). External link
Bécotte-Boutin, H.-S., Caporossi, G., & Hertz, A. (2015). The progressive visualization, a new tool for analyzing the writing process. (Technical Report n° G-2015-141). External link
Altinakar, S., Caporossi, G., & Hertz, A. (2014). A comparison of integer and constraint programming models for the deficiency problem. (Technical Report n° G-2014-25). External link
Aloise, D., Caporossi, G., Hansen, P., Liberti, L., Perron, S., & Ruiz, M. (2011). Modularity Maximization in Networks by Variable Neighborhood Search. (Technical Report n° G-2011-59). External link
Aloise, D., Cafieri, S., Caporossi, G., Hansen, P., Liberti, L., & Perron, S. (2010). Column Generation Algorithms for Exact Modularity Maximization in Networks. (Technical Report n° G-2010-36). External link
Altinakar, S., Caporossi, G., & Hertz, A. (2009). On Compact k-Edge-Colorings: A Polynomial Time Reduction From Linear to Cyclic. (Technical Report n° G-2009-53). External link
Aloise, D., Caporossi, G., Hansen, P., Liberti, L., Perron, S., & Ruiz, M. (2012, February). Modularity maximization in networks by variable neighborhood search [Paper]. 10th DIMACS Implementation Challenge Workshop, Atlanta, GA, USA (14 pages). External link
Caporossi, G., Hansen, P., & Zheng, M. (1998, March). Enumeration of fusenes to h=20 [Paper]. DIMACS Workshop on Discrete Mathematical Chemistry, Rutgers, New Brunswick. External link
Altinakar, S., Caporossi, G., & Hertz, A. (2009). On compact edge-colorings : a polynomial time reduction from k-linear to k-cyclic [Abstract]. Combinatorics Seminar (1 page). External link
Caporossi, G. (2000). Découverte par ordinateur en théorie des graphes [Ph.D. thesis, École Polytechnique de Montréal]. Available
Bécotte-Boutin, H.-S., Caporossi, G., Hertz, A., & Leblay, C. (2019). Writing and rewriting: the colored numerical visualization of Keystroke logging. In Lingdgren, E., & Sullivan, K. P. H. (eds.), Observing writing: insights from Keystroke logging and handwriting (pp. 96-114). External link
