Andreas Emil Feldmann

670 total citations
37 papers, 254 citations indexed

About

Andreas Emil Feldmann is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, Andreas Emil Feldmann has authored 37 papers receiving a total of 254 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Computational Theory and Mathematics, 10 papers in Electrical and Electronic Engineering and 10 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in Andreas Emil Feldmann's work include Advanced Graph Theory Research (19 papers), Complexity and Algorithms in Graphs (19 papers) and VLSI and FPGA Design Techniques (10 papers). Andreas Emil Feldmann is often cited by papers focused on Advanced Graph Theory Research (19 papers), Complexity and Algorithms in Graphs (19 papers) and VLSI and FPGA Design Techniques (10 papers). Andreas Emil Feldmann collaborates with scholars based in Czechia, United States and Switzerland. Andreas Emil Feldmann's co-authors include Luca Foschini, Juan Pablo Luna, Rajesh Chitnis, Jochen Könemann, Peter Widmayer, Pasin Manurangsi, Jorge Durand, Dániel Marx, Manuel Sorge and Laura Sanità and has published in prestigious journals such as Mathematical Programming, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Andreas Emil Feldmann

34 papers receiving 237 citations

Peers

Andreas Emil Feldmann

SPS

CTM

CNC

EEE

PSIR

Laurent Sébastien Fournier France

David A. Cooper United States

Alexandros A. Voudouris United Kingdom

Helen Gibson United Kingdom

Rafael Sotelo Uruguay

Monica Lagazio South Africa

Jongkil Kim Australia

David Köll Germany

Vittorio Bilò Italy

Indu Singh India

Laurent Sébastien Fournier France

Andreas Emil Feldmann

56 ×0.5

SPS

129 ×2.0

CTM

27 ×0.6

CNC

83 ×2.4

EEE

6 ×0.3

PSIR

Citations per year, relative to Andreas Emil Feldmann Andreas Emil Feldmann (= 1×) peers Laurent Sébastien Fournier

Countries citing papers authored by Andreas Emil Feldmann

Since Specialization

Citations

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

Fields of papers citing papers by Andreas Emil Feldmann

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Andreas Emil Feldmann

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

Feldmann, Andreas Emil. (2024). Repertoires of Terrorism. Columbia University Press eBooks. 1 indexed citations

Feldmann, Andreas Emil, et al.. (2024). The parameterized complexity of the survivable network design problem. Journal of Computer and System Sciences. 148. 103604–103604.

Feldmann, Andreas Emil & Juan Pablo Luna. (2023). Criminal Politics and Botched Development in Contemporary Latin America. Cambridge University Press eBooks. 12 indexed citations

Chitnis, Rajesh, Andreas Emil Feldmann, & Pasin Manurangsi. (2021). Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. ACM Transactions on Algorithms. 17(2). 1–68. 4 indexed citations

Feldmann, Andreas Emil, et al.. (2020). Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 16. 1 indexed citations

Chitnis, Rajesh, Andreas Emil Feldmann, & Ondřej Suchý. (2019). A Tight Lower Bound for Planar Steiner Orientation. Algorithmica. 81(8). 3200–3216. 1 indexed citations

Feldmann, Andreas Emil & Dániel Marx. (2018). The Parameterized Hardness of the k-Center Problem in Transportation\n Networks. arXiv (Cornell University). 2 indexed citations

Chitnis, Rajesh, Andreas Emil Feldmann, & Pasin Manurangsi. (2018). Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. Warwick Research Archive Portal (University of Warwick). 16. 4 indexed citations

Feldmann, Andreas Emil, et al.. (2018). Baby PIH: Parameterized Inapproximability of Min CSP. arXiv (Cornell University). 4 indexed citations

10.

Feldmann, Andreas Emil. (2017). Revolutionary Terror in the Colombian Civil War. Studies in Conflict and Terrorism. 41(10). 825–846. 8 indexed citations

11.

Feldmann, Andreas Emil, et al.. (2016). Lehman's Theorem and the Directed Steiner Tree Problem. SIAM Journal on Discrete Mathematics. 30(1). 141–153. 2 indexed citations

12.

Feldmann, Andreas Emil, Jochen Könemann, Neil Olver, & Laura Sanità. (2016). On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Mathematical Programming. 160(1-2). 379–406. 8 indexed citations

13.

Disser, Yann, Andreas Emil Feldmann, Max Klimm, & Matúš Mihaľák. (2014). Improving the Hk-bound on the price of stability in undirected Shapley network design games. Theoretical Computer Science. 562. 557–564. 5 indexed citations

14.

Feldmann, Andreas Emil & Peter Widmayer. (2014). An $$O(n^4)$$ O ( n 4 ) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. Algorithmica. 71(1). 181–200. 3 indexed citations

15.

Feldmann, Andreas Emil. (2013). Fast balanced partitioning is hard even on grids and trees. Theoretical Computer Science. 485. 61–68. 12 indexed citations

16.

Feldmann, Andreas Emil, et al.. (2012). Corner cuts are close to optimal: From solid grids to polygons and back. Discrete Applied Mathematics. 161(7-8). 970–998. 1 indexed citations

17.

Feldmann, Andreas Emil & Luca Foschini. (2011). Balanced partitions of trees and applications. Repository for Publications and Research Data (ETH Zurich). 733. 1 indexed citations

18.

Feldmann, Andreas Emil, et al.. (2008). Mortandad en la frontera. Migración y Desarrollo. 6(10). 11–35. 10 indexed citations

19.

Feldmann, Andreas Emil. (2005). A Shift in the Paradigm of Violence: Non-Governmental Terrorism in Latin America since the End of the Cold War. Revista de ciencia política. 25(2). 6 indexed citations

20.

Feldmann, Andreas Emil, et al.. (2004). Reassessing the Causes of Nongovernmental Terrorism in Latin America. Latin American Politics and Society. 46(2). 101–132. 52 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