Why The Complete Bipartite Graph K3,3 Is Not Planar
The graphs $$K_5$$ and $$K_{3,3}$$ are two of the most important graphs within the subject of planarity in graph theory. Kuratowski’s theorem tells us that, if we can find a subgraph in any graph that...
View ArticleScala First Impressions
A few months ago, my co-workers and I converted a central part of our codebase from Java and Groovy into Scala. Though I am, by no means, a Scala expert at this point, I wanted to share some of my...
View ArticleComputer Science and Telescopes
Whenever there is a discussion about what Computer Science is and what it is not, it is a near-certainty that a particular quote will soon be used. Computer science is no more about computers than...
View ArticleNeed-Driven Development
I love Test-Driven Development, but I’ve found that there are a number of different ways people actually do TDD in real-world projects. Over time, I have discovered that I have a particular way of...
View ArticleTraveling Salesperson: The Most Misunderstood Problem
Whenever people start talking about NP-Complete problems, or even NP problems, one of the first examples they reach for is the classic Traveling Salesperson Problem. TSP makes sense because it...
View ArticleGetting “Real Work” Done
There are a lot of things that annoy me in my industry: lack of commitment to writing quality code, no discipline regarding tests, and many, many more. These things irritate me, and I see them all the...
View ArticleBook Review: The Career Programmer
I recently read a book called The Career Programmer by Christopher Duncan. I typically don’t post book reviews unless I really love a book and want to spread the word, but in this case I felt compelled...
View ArticleScala Second Impressions
In December, I posted about my early thoughts on Scala after using it for a short time. Initially, I thought that using Scala didn’t buy very much – the functional style could be adopted in in Java,...
View ArticleA Stroll Through the Complexity Zoo
This Fall, I took a course on Computational Complexity. I’ve been exposed to complexity in Computer Science before, but as an undergrad it rarely went beyond discussing P, NP, and NP-Complete. While I...
View ArticleBrief Thoughts on Software Craftsmanship
To catch people up on some blogosphere drama: Last month, Heather Arthur posted on her blog about an unfortunate incident in which some people on Twitter had found some code she wrote in GitHub, and...
View ArticleOSCON 2013: A Review
This year, I went to O’Reilly’s Open Source Convention, OSCON. Every year for the last four years, I’ve gone to a big tech conference. For the last three, I went to NoFluffJustStuff, which was later...
View ArticleDiving Into Android
I’ve finally written my first real Android app. I dabbled a bit with Android development in the very early days, writing an app that interacted with the web services of the company I was working for at...
View ArticleTop 10 Career-Changing Programming Books
When I graduated with a Computer Science degree ten years ago, I was excited to dive into the world of professional programming. I had done well in school, and I thought I was completely ready to be...
View Article
More Pages to Explore .....