Lorant Porkolab
- Computer Networks and Communications top 10%
- Industrial and Manufacturing Engineering top 5%
- Computational Theory and Mathematics top 5%
- Numerical Analysis top 10%
- Electrical and Electronic Engineering
- Topics
- Optimization and Search Problems (8 papers)Scheduling and Optimization Algorithms (7 papers)Complexity and Algorithms in Graphs (5 papers)
- Cited by
- Industrial and Manufacturing EngineeringNumerical AnalysisComputer Graphics and Computer-Aided Design
- Partner nations
- GermanyUnited StatesSwitzerland
In The Last Decade
Lorant Porkolab
14 papers receiving 243 citations
Peers
Comparison fields: 5 of 32
- Computer Networks and Communications 128
- Industrial and Manufacturing Engineering 119
- Computational Theory and Mathematics 104
- Numerical Analysis 44
- Electrical and Electronic Engineering 40
Countries citing papers authored by Lorant Porkolab
This map shows the geographic impact of Lorant Porkolab'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 Lorant Porkolab with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Lorant Porkolab more than expected).
Fields of papers citing papers by Lorant Porkolab
This network shows the impact of papers produced by Lorant Porkolab. 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 Lorant Porkolab. The network helps show where Lorant Porkolab may publish in the future.
Co-authorship network of co-authors of Lorant Porkolab
This figure shows the co-authorship network connecting the top 25 collaborators of Lorant Porkolab. A scholar is included among the top collaborators of Lorant Porkolab 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 Lorant Porkolab. Lorant Porkolab is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 14 | |
| 2 | 8 | |
| 3 | 11 | |
| 4 | 1 | |
| 5 | 9 | |
| 6 | 5 | |
| 7 | 30 | |
| 8 | 43 | |
| 9 | 24 | |
| 10 | Linear-time approximation schemes for scheduling malleable parallel tasks | 23 |
| 11 | 44 | |
| 12 | 46 | |
| 13 | 1 | |
| 14 | 8 |
About Lorant Porkolab
Lorant Porkolab is a scholar working on Industrial and Manufacturing Engineering, Numerical Analysis and Computational Theory and Mathematics, having authored 14 papers that have together received 267 indexed citations. Recurring topics across this work include Optimization and Search Problems (8 papers), Scheduling and Optimization Algorithms (7 papers) and Complexity and Algorithms in Graphs (5 papers). The work is most often cited by research in Industrial and Manufacturing Engineering (119 citations), Numerical Analysis (44 citations) and Computer Graphics and Computer-Aided Design (24 citations). Lorant Porkolab has collaborated with scholars based in Germany, United States and Switzerland. Frequent co-authors include Klaus Jansen, Leonid Khachiyan, Michael D. Grigoriadis and Jorge Villavicencio. Their work appears in journals such as Drug Discovery Today, Mathematical Programming and SIAM Journal on Computing.
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.