Books

Introduction to Computing Using Python: An Application Development Focus, John Wiley & Sons, 2012.

Introduction to Computing Using Python: An Application Development Focus, 2nd Edition, John Wiley & Sons, 2015.

Articles

The Stretch Factor of Hexagon-Delaunay Triangulations. To be published in the Proceedings of the 36th Symposium on Computational Geometry, 2020. (With Michael Dennis and Duru Türkoglu.)

Upper and Lower Bounds for Online Routing on Delaunay Triangulations. In Discrete & Computational Geometry 58(2): 482-504, 2017. (With Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, and André van Renssen).

Degree four plane spanners: Simpler and better. Journal of Computational Geometry 8(2): 3-31, 2017. (With Iyad A. Kanj and Duru Türkoglu.)

On the Ordered List Subgraph Embedding Problems. In Algorithmica, 74:2:992-1018, 2016. (With O. Hassan, I. Kanj, and D. Lokshtanov).

Degree Four Plane Spanners: Simpler and Better. In Proceedings of the Symposium on Computational Geometry 45:1-45:15, 2016. (With Iyad A. Kanj and Duru Türkoglu.)

Upper and Lower Bounds for Online Routing on Delaunay Triangulations. In Proceedings of the 23rd Annual European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, vol. 9294, pages 203-214, Springer, 2015. (With Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, and André van Renssen).

There are Plane Spanners of Degree 4 and Moderate Stretch Factor. Discrete & Computational Geometry, 53, 3:514-546, 2015. (With N. Bonichon, I. Kanj, and G. Xia).

Tight Stretch Factors for L₁-and L_∞-Delaunay Triangulations. In Computational Geometry Theory and Applications. Computational Geometry: Theory and Applications, 48, 3:237-250, 2015. (With N. Bonichon, C. Gavoille, and N. Hanusse.)

There are Plane Spanners of Maximum Degree 4. In Proceedings of the 30th Annual Symposium on Computational Geometry (SoCG), page 20, 2014. (With N. Bonichon, I. Kanj, and G. Xia.)

On the Ordered List Subgraph Embedding Problems. In 8th International Symposium on Parameterized and Exact Computation. Lecture Notes in Computer Science, vol. 8246, pages 189-201, Springer, 2013. (With O. Hassan, I. Kanj, and D. Lokshtanov.)

The Stretch Factor of L₁- and L_∞-Delaunay Triangulations. In 20^th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, vol. 7501, pages 205-216. Springer, 2012. (With N. Bonichon, C. Gavoille, and N. Hanusse.)

Plane spanners of maximum degree six. In 37^th International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol. 6198, pages 19-30. Springer, 2010. (With N. Bonichon, C. Gavoille, and N. Hanusse.)

Comment résumer le plan. In 12^èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), volume inria-00476151. HAL, 2010. (With N. Bonichon, C. Gavoille, N. Hanusse, and D. Ilcinkas.)

File References, Trees, and Computational Thinking. To be published in the Proceedings of the 15th Annual Conference on Innovation and Technology in Computer Science Education (ITiCSE 2010), 2010. (With C. Miller and A. Settle.)

A Framework for Computational Thinking across the Curriculum. To be published in the Proceedings of the 15th Annual Conference on Innovation and Technology in Computer Science Education (ITiCSE 2010), 2010. (With A. Settle, S. Hwang, and J. Jones.)

On Spanners and Lightweight Spanners of Geometric Graphs. In SIAM Journal of Computing, 39, 6:2132-2161, 2010. (With I. Kanj and G. Xia.)

Local Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks. In IEEE Transactions on Mobile Computing, 8, 4:460-474, 2009. (With I. Kanj and G. Xia.)

Computing lightweight spanning subgraphs locally. In Proceedings of the 22nd International Symposium on Distributed Computing (DISC 2008), Lecture Notes in Computer Science, 5218:365-378, 2008. (With I. Kanj and G. Xia.)

On Geometric Spanners of Euclidean and Unit Disk Graphs. Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008), pages 409-420, 2008. (With I. Kanj.)

Strictly Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks. Proceedings of the 4th ACM SIGACT-SIGOPS International Workshop on Foundations of Mobile Computing (DIAL-M-POMC 2007), 2007. (With I. Kanj and G. Xia.)

Computing Branches Out: On Revitalizing Computing Education. Proceedings of the International Conference on Frontiers in Education: Computer Science and Computer Engineering (FECS 2007), Las Vegas, NV, CSREA Press, 22-27, June 2007. (With A. Settle.)

Genus Characterizes the Complexity of Graph Problems: Some Tight Results. Journal of Computer and System Sciences, 73, 6:892-907, 2007.
Quality-of-Service Provisioning via Stochastic Path Selection under Weibullian Link Delays. Proceedings of the Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QShine'07), 2007. (With S. Uludag, A. Kashkanova, and K. Akkaya.)
Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks. Proceedings of the 2nd International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSOR 06), Lecture Notes in Computer Science, 4240:95-106, 2006. (With I. Kanj.)
A Case for Application-Aware Grid Services. Proceedings of Computing in High Energy Physics (CHEP06), Mumbai, India, Feb 2006. (With G. Garzoglio, A. Baranovski, P. Mhashilkar, and A. Rajendra.)
Bounding the firing synchronization problem on a ring. Theoretical Computer Science, 320(2-3): 213-228, 2004. (With André Berthiaume, Todd Bittner, Amber Settle, and Janos Simon.)
A Note on Baker's Algorithm. Technical report, CDM, DePaul University, 2004. (With I. Kanj.)
Genus Characterizes the Complexity of Graph Problems: Some Tight Results. Proceedings of the 30th International Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science (LNCS), 2719:845 -856, 2003. (With J. Chen, E. Sedgwick, and G. Xia.)

Improved Parameterized Algorithms for Planar Dominating Set. Proceedings of the 27th Annual Symposium on Mathematical Foundations of Computer Science (MFCS'02), Lecture Notes in Computer Science (LNCS), 2440:399-410, 2002. (With I. Kanj.)
New Bounds for the Firing Squad Problem on a Ring. In proceedings of the 9th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Carleton Scientific, 17-31, 2002. (With A. Berthiaume, A. Settle, and J. Simon.)
Inexpensive d-Dimensional Matchings. Random Structures and Algorithms, 20, 1:50-58, 2002. (With Baei-Shi Huang and Eric Schmutz.)
An Improved Algorithm for Finding Tree Decompositions of Small Width. In International Journal on Foundations of Computer Science, 11, 3:365--372, 2000. (With B. Reed.)
An Improved Algorithm for Finding Tree Decompositions of Small Width. Proceedings of the 25th International Workshop on Graph Theoretic Concepts in Computer Science (WG'99), Lecture Notes in Computer Science (LNCS), 1665:148-155, 1999.

Edge Coloring, Polyhedra and Probability (PhD dissertation). Technical Report CMU-CS-98-176, School of Computer Science, Carnegie Mellon University, 1998.

Edge Coloring Regular Graphs of High Degree. Discrete Mathematics, 165/166:567-579, 1997. (With B. Reed.)

A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. Combinatorics, Probability and Computing, 2, 3:271-284, 1993. (With. M Dyer, A. Frieze, R. Kannan, A. Kapoor, and U. Vazirani.)