Wireless sensor network, Key distribution in wireless sensor networks, Mathematical optimization, Algorithm and Point are his primary areas of study. His Wireless sensor network research incorporates elements of Real-time computing and Boundary, Topology. Sándor P. Fekete interconnects Tree traversal and Computational geometry in the investigation of issues within Mathematical optimization.
The various areas that Sándor P. Fekete examines in his Algorithm study include Wang tile and Constant. As a member of one scientific family, Sándor P. Fekete mostly works in the field of Packing problems, focusing on Branch and bound and, on occasion, Scheduling and Discrete mathematics. Within one scientific family, Sándor P. Fekete focuses on topics pertaining to Facility location problem under Approximation algorithm, and may sometimes address concerns connected to Combinatorics.
His primary areas of study are Combinatorics, Wireless sensor network, Discrete mathematics, Distributed computing and Algorithm. His Combinatorics research includes themes of Point and Set. His Wireless sensor network study combines topics in areas such as Wireless, Key distribution in wireless sensor networks, Mobile wireless sensor network, Real-time computing and Topology.
His research investigates the link between Real-time computing and topics such as Embedded system that cross with problems in Scheduling. His work carried out in the field of Algorithm brings together such families of science as Robot, Sequence, Swarm behaviour and Wang tile. His research on Approximation algorithm concerns the broader Mathematical optimization.
His primary scientific interests are in Robot, Combinatorics, Scheduling, Algorithm and Set. His study in Robot is interdisciplinary in nature, drawing from both Distributed algorithm, Path, Swarm behaviour and Computer vision. His research integrates issues of Point, Plane and Regular polygon in his study of Combinatorics.
His Scheduling study combines topics from a wide range of disciplines, such as Field-programmable gate array, Control reconfiguration and Satellite. His studies in Algorithm integrate themes in fields like Workspace and Sequence. His Set research is multidisciplinary, incorporating perspectives in Incircle and excircles of a triangle and Circle packing, Tetrahedron packing, Packing problems.
Sándor P. Fekete mainly investigates Algorithm, Workspace, Combinatorics, Discrete mathematics and Computation. His research in Algorithm intersects with topics in Set and Task. He has researched Set in several fields, including Function, Sequence and Polyomino.
He incorporates Combinatorics and Conflict free in his research. Particularly relevant to Brooks' theorem is his body of work in Discrete mathematics. His biological study spans a wide range of topics, including Universal logic, Logic gate, Software and Theory of computation.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Approximation algorithms for lawn mowing and milling
Esther M. Arkin;Sándor P. Fekete;Joseph S. B. Mitchell.
Computational Geometry: Theory and Applications (2000)
An Exact Algorithm for Higher-Dimensional Orthogonal Packing
Sándor P. Fekete;Jörg Schepers;Jan C. van der Veen.
Operations Research (2007)
Neighborhood-Based Topology Recognition in Sensor Networks
Sándor P. Fekete;Alexander Kröller;Dennis Pfisterer;Stefan Fischer.
algorithmic aspects of wireless sensor networks (2004)
Deterministic boundary recognition and topology extraction for large sensor networks
Alexander Kröller;Sándor P. Fekete;Dennis Pfisterer;Stefan Fischer.
symposium on discrete algorithms (2006)
DyNoC: A dynamic infrastructure for communication in dynamically reconfugurable devices
C. Bobda;A. Ahmadinia;M. Majer;J. Teich.
field-programmable logic and applications (2005)
New classes of fast lower bounds for bin packing problems
Sándor P. Fekete;Jörg Schepers.
Mathematical Programming (2001)
Optimal FPGA module placement with temporal precedence constraints
S. Fekete;E. Kohler;J. Teich.
design, automation, and test in europe (2001)
A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
Sándor P. Fekete;Jörg Schepers.
Mathematics of Operations Research (2004)
SpyGlass: a wireless sensor network visualizer
Carsten Buschmann;Dennis Pfisterer;Stefan Fischer;Sándor P. Fekete.
ACM Sigbed Review (2005)
Optimal Covering Tours with Turn Costs
Esther M. Arkin;Michael A. Bender;Erik D. Demaine;Sándor P. Fekete.
SIAM Journal on Computing (2005)
If you think any of the details on this page are incorrect, let us know.
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: