Sanjeeb Dash

1.5k total citations
46 papers, 714 citations indexed

About

Sanjeeb Dash is a scholar working on Computational Theory and Mathematics, Industrial and Manufacturing Engineering and Numerical Analysis. According to data from OpenAlex, Sanjeeb Dash has authored 46 papers receiving a total of 714 indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Computational Theory and Mathematics, 23 papers in Industrial and Manufacturing Engineering and 8 papers in Numerical Analysis. Recurrent topics in Sanjeeb Dash's work include Complexity and Algorithms in Graphs (18 papers), Vehicle Routing Optimization Methods (17 papers) and Advanced Graph Theory Research (15 papers). Sanjeeb Dash is often cited by papers focused on Complexity and Algorithms in Graphs (18 papers), Vehicle Routing Optimization Methods (17 papers) and Advanced Graph Theory Research (15 papers). Sanjeeb Dash collaborates with scholars based in United States, Chile and Italy. Sanjeeb Dash's co-authors include Oktay Günlük, William J. Cook, David Applegate, Andrea Lodi, André Rohe, Andrea Tramontani, Marcos Goycoolea, Merve Bodur, James Luedtke and Uday Bondhugula and has published in prestigious journals such as Nature Communications, European Journal of Operational Research and Mathematical Programming.

In The Last Decade

Sanjeeb Dash

44 papers receiving 650 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Sanjeeb Dash United States	15	341	278	120	109	101	46	714
Cid C. de Souza Brazil	18	386 1.1×	246 0.9×	100 0.8×	277 2.5×	43 0.4×	82	1.1k
Stefan E. Karisch Austria	9	635 1.9×	286 1.0×	309 2.6×	200 1.8×	162 1.6×	11	1.1k
Jean‐Claude Picard Canada	10	481 1.4×	255 0.9×	95 0.8×	190 1.7×	34 0.3×	18	949
Bettina Klinz Austria	11	146 0.4×	177 0.6×	42 0.3×	130 1.2×	23 0.2×	33	516
L. E. Trotter United States	12	535 1.6×	704 2.5×	139 1.2×	279 2.6×	69 0.7×	30	1.4k
Wenxing Zhu China	17	129 0.4×	196 0.7×	178 1.5×	105 1.0×	112 1.1×	125	938
Michele Conforti Italy	19	278 0.8×	874 3.1×	141 1.2×	242 2.2×	134 1.3×	91	1.3k
Tania Querido Brazil	7	270 0.8×	78 0.3×	147 1.2×	106 1.0×	26 0.3×	8	583
Jean‐Louis Goffin Canada	18	296 0.9×	503 1.8×	76 0.6×	75 0.7×	571 5.7×	42	1.1k
Didier El Baz France	15	223 0.7×	201 0.7×	161 1.3×	246 2.3×	118 1.2×	59	673

Countries citing papers authored by Sanjeeb Dash

Since Specialization

Citations

This map shows the geographic impact of Sanjeeb Dash'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 Sanjeeb Dash with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sanjeeb Dash more than expected).

Fields of papers citing papers by Sanjeeb Dash

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Sanjeeb Dash. 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 Sanjeeb Dash. The network helps show where Sanjeeb Dash may publish in the future.

Co-authorship network of co-authors of Sanjeeb Dash

This figure shows the co-authorship network connecting the top 25 collaborators of Sanjeeb Dash. A scholar is included among the top collaborators of Sanjeeb Dash 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 Sanjeeb Dash. Sanjeeb Dash 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

Dash, Sanjeeb, et al.. (2024). Evolving scientific discovery by unifying data and background knowledge with AI Hilbert. Nature Communications. 15(1). 5922–5922. 7 indexed citations

Dash, Sanjeeb, Vernon Austel, Tyler R. Josephson, et al.. (2023). Combining data and theory for derivable scientific discovery with AI-Descartes. Nature Communications. 14(1). 1777–1777. 39 indexed citations

Wei, Dennis, Sanjeeb Dash, Tian Gao, & Oktay Günlük. (2019). Generalized Linear Rule Models. International Conference on Machine Learning. 6687–6696. 4 indexed citations

Dash, Sanjeeb, et al.. (2018). Binary extended formulations of polyhedral mixed-integer sets. Mathematical Programming. 170(1). 207–236. 3 indexed citations

Dash, Sanjeeb, Oktay Günlük, & Dennis Wei. (2018). Boolean Decision Rules via Column Generation. arXiv (Cornell University). 31. 4655–4665. 18 indexed citations

Dash, Sanjeeb, et al.. (2017). On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width. SIAM Journal on Optimization. 27(3). 1340–1361. 3 indexed citations

Bodur, Merve, Sanjeeb Dash, & Oktay Günlük. (2016). Cutting planes from extended LP formulations. Mathematical Programming. 161(1-2). 159–192. 5 indexed citations

Dash, Sanjeeb, Oktay Günlük, & Marco Molinaro. (2015). On the relative strength of different generalizations of split cuts. Discrete Optimization. 16. 36–50. 3 indexed citations

Dash, Sanjeeb, et al.. (2013). Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming. Mathematical Programming. 145(1-2). 483–508. 10 indexed citations

10.

Dash, Sanjeeb & Oktay Günlük. (2012). On t-branch split cuts for mixed-integer programs. Mathematical Programming. 141(1-2). 591–599. 5 indexed citations

11.

Dash, Sanjeeb, et al.. (2011). IBM Research Report Lattice-Free Sets, Branching Disjunctions, and Mixed-Integer Programming. 3 indexed citations

12.

Dash, Sanjeeb & Marcos Goycoolea. (2010). A heuristic to generate rank-1 GMI cuts. Mathematical Programming Computation. 2(3-4). 231–257. 14 indexed citations

13.

Dash, Sanjeeb, Oktay Günlük, Andrea Lodi, & Andrea Tramontani. (2010). A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows. INFORMS journal on computing. 24(1). 132–147. 63 indexed citations

14.

Dash, Sanjeeb & Oktay Günlük. (2009). On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs. SIAM Journal on Optimization. 20(2). 1090–1109. 6 indexed citations

15.

Dash, Sanjeeb. (2008). On the complexity of cutting plane proofs using split cuts.. Electronic colloquium on computational complexity. 15. 2 indexed citations

16.

Dash, Sanjeeb, Oktay Günlük, & Andrea Lodi. (2008). MIR closures of polyhedral sets. Mathematical Programming. 121(1). 33–60. 33 indexed citations

17.

Dash, Sanjeeb & Oktay Günlük. (2007). On the strength of Gomory mixed-integer cuts as group cuts. Mathematical Programming. 115(2). 387–407. 8 indexed citations

18.

Neelamani, Ramesh, Sanjeeb Dash, & Richard G. Baraniuk. (2007). On Nearly Orthogonal Lattice Bases and Random Lattices. SIAM Journal on Discrete Mathematics. 21(1). 199–219. 8 indexed citations

19.

Dash, Sanjeeb & Oktay Günlük. (2005). Valid inequalities based on simple mixed-integer sets. Mathematical Programming. 105(1). 29–53. 35 indexed citations

20.

Applegate, David, William J. Cook, Sanjeeb Dash, & André Rohe. (2002). Solution of a Min-Max Vehicle Routing Problem. INFORMS journal on computing. 14(2). 132–143. 95 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