<p>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. </p>

CC BY-SA 3.0
2014-07-15T23:32:54.260Z
2014-07-15T23:32:54.260Z
Sariel Har-Peled
<p><a href="http://www.journals.elsevier.com/information-processing-letters/" rel="nofollow">IPL (for Information Processing Letters)</a> is a good place for publishing short papers.</p>

CC BY-SA 3.0
2014-07-15T23:29:49.200Z
Not really. Its published by the evil elsevier.
Sariel Har-Peled
CC BY-SA 3.0
2014-07-13T08:30:57.883Z
2014-07-13T09:10:53.617Z
2014-07-13T09:10:53.617Z
Kai
<p><a href="http://www.di.unipi.it/fun14/">Fun with Algorithms</a>!  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 <a href="http://link.springer.com/chapter/10.1007/978-3-319-07890-8_4">this one</a>.  </p>

<p>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.</p>

CC BY-SA 3.0
2014-07-10T17:26:00.977Z
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
rahulmehta95
CC BY-SA 3.0
2014-07-11T19:17:09.187Z
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.
Sasho Nikolov
CC BY-SA 3.0
2014-07-14T21:37:56.147Z
@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.
rahulmehta95
CC BY-SA 3.0
2014-07-10T16:17:57.113Z
2014-07-10T16:17:57.113Z
Hsien-Chih Chang 張顯之
<p>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?</p>

CC BY-SA 3.0
2014-07-11T12:01:30.467Z
Theory of Computing has "short communications", but I am not sure how good of a fit your result is: http://theoryofcomputing.org/categories/short.html.
Sasho Nikolov
CC BY-SA 3.0
2014-07-13T13:18:47.010Z
If the game is econ-related, perhaps as a letter in the [ACM SIGECOM Exchanges](http://www.sigecom.org/exchanges/)?
usul
CC BY-SA 3.0
2014-07-13T13:49:01.013Z
A less known journal where you could certainly publish it is http://www.acta.sapientia.ro/acta-info/informatica-main.htm
domotorp
CC BY-SA 3.0
2014-07-13T18:18:57.990Z
Post it to arXiv.
Jeffε
<journals>
Venues for short research articles
rahulmehta95
# Venues for short research articles

(Asked by: username_0 on 2014-07-10)

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?

**Tags:** journals
> **Comments:**
> **username_1**: Theory of Computing has "short communications", but I am not sure how good of a fit your result is: http://theoryofcomputing.org/categories/short.html.  
> **username_2**: If the game is econ-related, perhaps as a letter in the [ACM SIGECOM Exchanges](http://www.sigecom.org/exchanges/)?  
> **username_3**: A less known journal where you could certainly publish it is http://www.acta.sapientia.ro/acta-info/informatica-main.htm  
> **username_4**: Post it to arXiv.  

---

## 3 answers

### Answer by username_7 on 2014-07-10. Score: 11 | Accepted answer

[Fun with Algorithms](http://www.di.unipi.it/fun14/)! 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](http://link.springer.com/chapter/10.1007/978-3-319-07890-8_4).

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.

> **Comments:**
> **username_0**: 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  
> **username_1**: 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.  
> **username_0**: @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.  

---

### Answer by username_5 on 2014-07-15. Score: 6

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.


---

### Answer by username_6 on 2014-07-13. Score: 2

[IPL (for Information Processing Letters)](http://www.journals.elsevier.com/information-processing-letters/) is a good place for publishing short papers.

> **Comments:**
> **username_5**: Not really. Its published by the evil elsevier.  

---

