World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
52
Citations
8467
World Ranking
5166
National Ranking
237

Mathematics

D-Index
47
Citations
6949
World Ranking
1296
National Ranking
73

Overview

Sándor P. Fekete is affiliated with Technische Universität Braunschweig in Germany. Their research spans primarily the fields of Computer Science and Engineering.

Their work includes a strong focus on several subfields of study, notably:

  • Computer Networks and Communications
  • Computer Graphics and Computer-Aided Design
  • Mechanical Engineering
  • Industrial and Manufacturing Engineering
  • Molecular Biology

Fekete's research covers a range of main topics, including:

  • Computational Geometry and Mesh Generation
  • Modular Robots and Swarm Intelligence
  • Optimization and Search Problems
  • Constraint Satisfaction and Optimization
  • Optimization and Packing Problems
  • Robotic Path Planning Algorithms
  • 3D Modeling in Geospatial Applications

Their recent scholarly contributions feature several papers across various reputable publication venues. Some of the notable recent publications are:

  • Towards the automated operations of large distributed satellite systems. Part 1: Review and paradigm shifts, 2020, Advances in Space Research
  • Robust disease module mining via enumeration of diverse prize-collecting Steiner trees, 2021, Bioinformatics
  • A Real-World Rheumatology Registry and Research Consortium: The German RheumaDatenRhePort (RHADAR) Registry, 2021, Journal of Medical Internet Research
  • Towards the automated operations of large distributed satellite systems. Part 2: Classifications and tools, 2020, Advances in Space Research
  • High prevalence of suicide-related internet use among patients with depressive disorders - a cross-sectional study with psychiatric in-patients, 2022, Psychiatry Research

Their frequent co-authors include:

  • Phillip Keldenich
  • Dominik Krupke
  • Christian Scheffer
  • Christian Rieck
  • Linda Kleist

Fekete's work has appeared multiple times in leading publication venues such as:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • ACM Journal of Experimental Algorithmics
  • Advances in Space Research
  • Discrete & Computational Geometry

The volume of publications indicates sustained research activity, with 92 publications in Computer Science and 50 in Engineering across various conferences, journals, and repositories. Their focused topics reveal a blend of theoretical and applied research, including computational geometry, robotics, optimization, and biomedical informatics.

Best Publications

  • Approximation algorithms for lawn mowing and milling

    Esther M. Arkin;Sándor P. Fekete;Joseph S. B. Mitchell

  • An Exact Algorithm for Higher-Dimensional Orthogonal Packing

    Sándor P. Fekete;Jörg Schepers;Jan C. van der Veen

  • Neighborhood-Based Topology Recognition in Sensor Networks

    Sándor P. Fekete;Alexander Kröller;Dennis Pfisterer;Stefan Fischer

  • Deterministic boundary recognition and topology extraction for large sensor networks

    Alexander Kröller;Sándor P. Fekete;Dennis Pfisterer;Stefan Fischer

  • DyNoC: A dynamic infrastructure for communication in dynamically reconfugurable devices

    C. Bobda;A. Ahmadinia;M. Majer;J. Teich

  • New classes of fast lower bounds for bin packing problems

    Sándor P. Fekete;Jörg Schepers

  • A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing

    Sándor P. Fekete;Jörg Schepers

  • Optimal FPGA module placement with temporal precedence constraints

    S. Fekete;E. Kohler;J. Teich

  • Optimal Covering Tours with Turn Costs

    Esther M. Arkin;Michael A. Bender;Erik D. Demaine;Sándor P. Fekete

  • SpyGlass: a wireless sensor network visualizer

    Carsten Buschmann;Dennis Pfisterer;Stefan Fischer;Sándor P. Fekete

  • Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments

    Tien-Ruey Hsiang;Esther M. Arkin;Michael A. Bender;Sándor P. Fekete

  • Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues

    Erik D. Demaine;Martin L. Demaine;Sándor P. Fekete;Mashhood Ishaque

  • Flexible experimentation in wireless sensor networks

    Geoff Coulson;Barry Porter;Ioannis Chatzigiannakis;Christos Koninis

  • A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems

    Sándor P. Fekete;Jörg Schepers

  • Minimum-cost coverage of point sets by disks

    Helmut Alt;Esther M. Arkin;Hervé Brönnimann;Jeff Erickson

  • Online searching with turn cost

    Erik D. Demaine;Sándor P. Fekete;Shmuel Gal

  • A New Approach for Boundary Recognition in Geometric Sensor Networks.

    Sándor P. Fekete;Michael Kaufmann;Alexander Kröller;Katharina Anna Lehmann

  • Tree Spanners in Planar Graphs

    Sándor P. Fekete;Jana Kremer

  • A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems

    Sándor P. Fekete;Jörg Schepers

  • Shawn: A new approach to simulating wireless sensor networks

    Alexander Kröller;Dennis Pfisterer;Carsten Buschmann;Sándor P. Fekete

  • Neighborhood-Based Topology Recognition in Sensor Networks

    Sandor P. Fekete;Alexander Kroeller;Dennis Pfisterer;Stefan Fischer

  • DyNoC: A Dynamic Infrastructure for Communication in Dynamically Reconfigurable Devices

    Christophe Bobda;Ali Ahmadinia;Mateusz Majer;Juergen Teich

Frequent Co-Authors

Joseph S. B. Mitchell
Joseph S. B. Mitchell Stony Brook University
Esther M. Arkin
Esther M. Arkin Stony Brook University
Jürgen Teich
Jürgen Teich University of Erlangen-Nuremberg
Ulrich Faigle
Ulrich Faigle University of Cologne
Walter Kern
Walter Kern University of Twente
Michael A. Bender
Michael A. Bender Stony Brook University
Ioannis Chatzigiannakis
Ioannis Chatzigiannakis Sapienza University of Rome
Kay Römer
Kay Römer Graz University of Technology
Christian Scheideler
Christian Scheideler University of Paderborn

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Mathematics in the USA opens doors to various online degrees that complement and expand career opportunities. For those interested in data-driven roles, pursuing a analytics masters programs can provide advanced skills in data analysis, machine learning, and statistical modeling. These programs are increasingly popular for mathematicians looking to enter tech-driven industries.

If you're considering leadership roles in business, an MBA can be a strategic next step. Exploring the easiest mba programs helps prospective students find accessible pathways to earn a business degree without compromising quality. Additionally, resources highlighting the easiest mba program can guide students to online options that balance flexibility with credible curricula.

For those aiming at senior management or academic leadership, the cheapest dba online offers a cost-effective way to earn a Doctorate in Business Administration. This program can be a powerful tool for mathematicians looking to merge analytical expertise with executive decision-making skills.

Best Scientists Citing Sándor P. Fekete

Trending Scientists