Javier Marenco

583 total citations
63 papers, 349 citations indexed

About

Javier Marenco is a scholar working on Industrial and Manufacturing Engineering, Management Science and Operations Research and Computational Theory and Mathematics. According to data from OpenAlex, Javier Marenco has authored 63 papers receiving a total of 349 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Industrial and Manufacturing Engineering, 23 papers in Management Science and Operations Research and 21 papers in Computational Theory and Mathematics. Recurrent topics in Javier Marenco's work include Vehicle Routing Optimization Methods (24 papers), Advanced Graph Theory Research (20 papers) and Scheduling and Timetabling Solutions (19 papers). Javier Marenco is often cited by papers focused on Vehicle Routing Optimization Methods (24 papers), Advanced Graph Theory Research (20 papers) and Scheduling and Timetabling Solutions (19 papers). Javier Marenco collaborates with scholars based in Argentina, Chile and Brazil. Javier Marenco's co-authors include Guillermo Durán, Flavia Bonomo, Frédéric Maffray, Paula Zabala, P. Rey, Santiago Durán, Annegret K. Wagler, Andrés Weintraub, Daniela Sabán and Mario Guajardo and has published in prestigious journals such as European Journal of Operational Research, Physica A Statistical Mechanics and its Applications and Annals of Operations Research.

In The Last Decade

Javier Marenco

50 papers receiving 331 citations

Peers

Javier Marenco

IME

MSOR

CTM

DEP

Rafael A. Melo Brazil

Wolfgang Kreutzer New Zealand

Leonardo Chwif Brazil

María Merino Spain

David Sturrock United States

Magdy Helal United States

Catherine M. Banks United States

Muh-Cherng Wu Taiwan

Pınar Yıldız Türkiye

Rafael A. Melo Brazil

Javier Marenco

198 ×1.4

IME

52 ×0.4

MSOR

22 ×0.3

CTM

6 ×0.1

11 ×0.3

DEP

Citations per year, relative to Javier Marenco Javier Marenco (= 1×) peers Rafael A. Melo

Countries citing papers authored by Javier Marenco

Since Specialization

Citations

This map shows the geographic impact of Javier Marenco's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Javier Marenco with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Javier Marenco more than expected).

Fields of papers citing papers by Javier Marenco

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Javier Marenco. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Javier Marenco. The network helps show where Javier Marenco may publish in the future.

Co-authorship network of co-authors of Javier Marenco

This figure shows the co-authorship network connecting the top 25 collaborators of Javier Marenco. A scholar is included among the top collaborators of Javier Marenco based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Javier Marenco. Javier Marenco is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Marenco, Javier, et al.. (2025). Clustering nodes in Internet of Things environments with time and energy constraints: a multiobjective optimization formulation for the gateway placement problem in LoRaWAN^® networks. International Transactions in Operational Research.

Marenco, Javier, et al.. (2023). A branch-and-cut algorithm for the routing and spectrum allocation problem. Discrete Applied Mathematics. 339. 107–126.

Marenco, Javier, et al.. (2021). The maximum 2D subarray polytope: Facet-inducing inequalities and polyhedral computations. Discrete Applied Mathematics. 323. 286–301.

Marenco, Javier, et al.. (2019). Facet-generating Procedures for the Maximum-impact Coloring Polytope. Electronic Notes in Theoretical Computer Science. 346. 199–208. 1 indexed citations

Marenco, Javier, et al.. (2018). Computing the P3-hull number of a graph, a polyhedral approach. Discrete Applied Mathematics. 255. 155–166. 1 indexed citations

Marenco, Javier. (2017). The caterpillar-packing polytope. Discrete Applied Mathematics. 245. 4–15.

Corrêa, Ricardo C., et al.. (2017). General cut-generating procedures for the stable set polytope. Discrete Applied Mathematics. 245. 28–41. 6 indexed citations

Linfati, Rodrigo, et al.. (2016). The maximum‐impact coloring polytope. International Transactions in Operational Research. 24(1-2). 303–324. 2 indexed citations

Marenco, Javier, et al.. (2015). Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope. RAIRO - Operations Research. 50(3). 627–644.

10.

Marenco, Javier, et al.. (2014). Topological additive numbering of directed acyclic graphs. Information Processing Letters. 115(2). 199–202. 1 indexed citations

11.

Marenco, Javier, et al.. (2013). Envy-free division of discrete cakes. Discrete Applied Mathematics. 164. 527–531. 3 indexed citations

12.

Marenco, Javier, et al.. (2012). A polyhedral study of the acyclic coloring problem. Discrete Applied Mathematics. 160(18). 2606–2617. 1 indexed citations

13.

Bonomo, Flavia, et al.. (2011). A polyhedral study of the maximum edge subgraph problem. Discrete Applied Mathematics. 160(18). 2573–2590.

14.

Marenco, Javier, et al.. (2011). A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem. Discrete Optimization. 8(4). 540–554.

15.

Durán, Guillermo, et al.. (2011). Solving the segmentation problem for the 2010 Argentine census with integer programming. Electronic Notes in Discrete Mathematics. 37. 279–284. 1 indexed citations

16.

Bonomo, Flavia, et al.. (2010). Minimum sum set coloring of trees and line graphs of trees. Discrete Applied Mathematics. 159(5). 288–294. 3 indexed citations

17.

Bonomo, Flavia, et al.. (2009). On the b-Coloring of Cographs and P 4-Sparse Graphs. Graphs and Combinatorics. 25(2). 153–167. 38 indexed citations

18.

Marenco, Javier & Annegret K. Wagler. (2008). Cycle-based facets of chromatic scheduling polytopes. Discrete Optimization. 6(1). 51–63. 1 indexed citations

19.

Marenco, Javier & Annegret K. Wagler. (2008). Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques. Discrete Optimization. 6(1). 64–78. 1 indexed citations

20.

Marenco, Javier & Annegret K. Wagler. (2006). On the combinatorial structure of chromatic scheduling polytopes. Discrete Applied Mathematics. 154(13). 1865–1876. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact