Hi! Here is a linkdump. I told myself I would post these with really minimal context because I am too busy to summarize these things and have a really giant backlog of links I’ve been wanting to post, but uh, the writer in me won out and I failed. Some of these have way more description than others. But I do also have quotes I’ve pulled for some of them, so maybe that will help make this post more interesting.

I recently decided I wanted try presenting my work at an academic conference, so I had to write and submit an abstract for my proposed presentation. The problem, of course, was that I had no idea how to write a scientific abstract, which was a bit of a problem. Most of the advice I received and could find online was too vague for my taste, so I decided to take matters into my own hands and deconstruct some abstracts to see how those authors did it. And I’m really glad I did, because it was very enlightening.

You know the drill. In the last episode I did of this series, I said the next one would be coming shortly, huh?

Yeah, right. I lied. These come out when they come out.

Here’s another linkdump—a list of links to stuff I thought was interesting but likely won’t get to properly reviewing any time soon.¹

I reserve the right to more fully review any of these article at a later date, of course. (Though at this point, it’s extremely unlikely to ever happen.)

Here is a long list of sources I consulted at various points while doing research for this project. As it might have become clear through reading the previous installments of this series, this was more a talk about the densest subgraph problem than it was about theory being useful in computer science. There are a few reasons for that, which I might explain in more detail at some point in the future. This means that I presented a lot of information that I borrowed from other people! Here’s an annotated bibliography of sorts, in case you were interested in going deeper, for whatever reason.