12
$\begingroup$

I've just completed a short (5 page) paper on proving a certain combinatorial game NP-Complete. This is in no way a result of huge significance, yet it's one that I believe is publishable. What venues would be good for a paper like this? The only one I'm aware of is Information Processing Letters; are there other ones like this?

$\endgroup$
4

3 Answers 3

11
$\begingroup$

Fun with Algorithms! Although it is a conference not a journal that you might looking for, among other things several NP-hardness results about (combinatorial) games are published here, including this one.

However this is a triennial conference (except for 2014, where the last conference was in 2012), so if you want to publish it soon then there might be a better choice.

$\endgroup$
3
  • 2
    $\begingroup$ I've seen fun with algorithms before, and it looks great! However I would like to try and publish this sooner, and also in general would like to know wahh other good venues there are for publishing short articles in complexity $\endgroup$ Jul 10, 2014 at 17:26
  • 1
    $\begingroup$ Rahul, keep in mind that even though FUN's next deadline is probably half a year away, even a fast journal would take about this long. ECCC should be a good place to announce a complexity result: it's fast, provides more screening than arxiv, does not care about length, and does not preclude future publication. $\endgroup$ Jul 11, 2014 at 19:17
  • $\begingroup$ @Sasho Nikolov I think I'm going to go ahead and do that. Thank you - I had always thought arxiv and ECCC were the same, but had never realized the difference. $\endgroup$ Jul 14, 2014 at 21:37
6
$\begingroup$

Put it on the arxiv. Yes, it is not refereed, but it does give you some limited visibility, and sooner or later, if it is interesting, it would get cited.

$\endgroup$
2
$\begingroup$

IPL (for Information Processing Letters) is a good place for publishing short papers.

$\endgroup$
1
  • 3
    $\begingroup$ Not really. Its published by the evil elsevier. $\endgroup$ Jul 15, 2014 at 23:29

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Not the answer you're looking for? Browse other questions tagged or ask your own question.