Edward R. Scheinerman

Johns Hopkins University

Papers

1

Total Citations

22

H-Index

1

About

Edward R. Scheinerman is a distinguished mathematician and computer scientist whose research spans discrete mathematics, graph theory, and combinatorial algorithms. He is perhaps best known for his pioneering work on fractional graph theory, particularly the concept of fractional arboricity, and for his influential textbook *Mathematics: A Discrete Introduction*, which has shaped undergraduate education for decades. Scheinerman’s contributions extend to applied combinatorics, as demonstrated in his highly cited paper "Determining planar location via complement-free de Bruijn sequences using discrete optical sensors" (2001, 22 citations), which introduced an elegant method for robot localization using patterned floor tiles and inexpensive sensors. This work exemplifies his talent for bridging theoretical constructs—such as de Bruijn sequences—with practical engineering challenges. While his citation counts reflect focused impact rather than raw volume, his ideas have proven durable, influencing robotics, sensor networks, and coding theory. A professor at Johns Hopkins University, Scheinerman is also celebrated for his clear, engaging writing and his ability to make complex mathematical ideas accessible to students and researchers alike.

Research Focus

Key Achievements

1
H-Index
1
Papers
22
Total Citations
22
Avg Citations/Paper
🏆 Most Cited Paper
Determining planar location via complement-free de Brujin sequences using discrete optical sensors
22 citations · 2001
📈 Most Prolific Year: 2001 (1 Papers)
🤝 Key Collaborators: 0
🏛 Institutions: Johns Hopkins University

Top Papers

  1. 1

Contact & Links

Available for collaboration
Content generated · 13 days ago