~~NOTOC~~

====== Publications (Group Members in Bold) ======
===== Peer Reviewed Publications =====


==== 2023 ====
  * **New Advances in Rightmost Lempel-Ziv**\\ //**Jonas Ellert, Johannes Fischer**, Max Rishøj Pedersen//\\ Accepted at SPIRE 2023
  * **Sublinear Time Lempel-Ziv 77 Factorization**\\ //**Jonas Ellert**//\\ Accepted at SPIRE 2023
  * **Lyndon Arrays in Sublinear Time**\\ //Hideo Bannai, **Jonas Ellert**//\\ Accepted at ESA 2023
  * **Ein Roboter lernt laufen: Vermittlung von Konzepten des verstärkenden Lernens im Informatikunterricht**\\ //Jan Laumeyer, **Jan Hendrik Krone**, **Johannes Fischer**//\\ Accepted at INFOS'23.
  * **[[https://doi.org/10.4230/LIPIcs.CPM.2023.4|Sliding Window String Indexing in Streams]]**\\ //Philip Bille, **Johannes Fischer**, Inge Li Gørtz, Max Rishøj Pedersen, Tord Joakim Stordalen//\\ Proc. CPM 2023, 4:1--4:18, **Best Student Paper Award**.
  * **[[https://doi.org/10.1109/DCC55655.2023.00016|Bit-Parallel (Compressed) Wavelet Tree Construction]]**\\ //**Patrick Dinklage, Johannes Fischer**, Florian Kurpicz, Jan-Philipp Tarnowski//\\ Proc. DCC 2023, 81-90.
  * **[[https://doi.org/10.1137/1.9781611977554.ch189|Optimal Square Detection Over General Alphabets]]**\\ //**Jonas Ellert**, Paweł Gawrychowski, Garance Gourdel//\\ Proc. SODA 2023, 5220--5242.
==== 2022 ====
  * **[[https://doi.org/10.4230/LIPIcs.ESA.2022.48|Lyndon Arrays Simplified]]**\\ //**Jonas Ellert**//\\ Proc. ESA 2022, LIPIcs 244, 48:1--48:14
  * **LIVE-Interaktion statt Videomaterial bei der Sensibilisierung für Inklusion und Computerzugänglichkeit! - Im E-Lecture fragen Studierende einen blinden Betroffenen**\\ //**Kensuke Akao**//\\ Proc. DELFI 2022, LNI P-322, 189-194.
  * **[[https://drops.dagstuhl.de/opus/volltexte/2022/16544/|A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs]]**\\ //**Nico Bertram, Jonas Ellert, Johannes Fischer**//\\ Proc. SEA 2022, 10.1-10.15
  * **[[https://doi.org/10.4230/LIPIcs.CPM.2022.13|Back-to-Front Online Lyndon Forest Construction]]**\\ //Golnaz Badkobeh, Maxime Crochemore, **Jonas Ellert** and Cyril Nicaud//\\ Proc. CPM 2022, LIPIcs 223, 13:1--13:23
==== 2021 ====
  * **[[https://doi.org/10.1145/3481638|Engineering Practical Lempel-Ziv Tries]]**\\ //Diego Arroyuelo, Rodrigo Canovas, **Johannes Fischer**, Dominik Köppl, Marvin Löbel, Gonzalo Navarro, Rajeev Raman//\\ ACM J. Exp. Algor. 26, Article No.: 1.14, pp 1-47.
  * **[[https://delfi-tagung.de/fileadmin/TG/DELFI/HDI_2021/5410_HDI-Tagungsband_-_Broschuere_-_L11_so.pdf#page=74|Wie können wir Lehramtsstudierende auf einen inklusiven Informatikunterricht vorbereiten?]]**\\ //**Kensuke Akao, Johannes Fischer**//\\ Proc. HDI 2021, 75-83.
  * **[[https://doi.org/10.4230/LIPIcs.ESA.2021.15|Lyndon Words Accelerate Suffix Sorting]]**\\ //**Nico Bertram, Jonas Ellert, Johannes Fischer**//\\ Proc. ESA 2021, LIPIcs 204, 15:1--15:13. 
  * **[[https://doi.org/10.1145/3457197|Practical Wavelet Tree Construction]]**\\ //**Patrick Dinklage, Jonas Ellert, Johannes Fischer, Florian Kurpicz, Marvin Löbel**//\\ ACM J. Exp. Algor. 26(1), Article No.: 1.8, pp 1–67.
  * **[[https://doi.org/10.18420/infos2021_p228|Reflexionsförderung bei Lehramtsstudierenden durch den Einsatz von videobasierten Aufgaben]]**\\ //**Johannes Fischer, Martin Weinert**//\\ INFOS'21, 261-270.
  * **[[https://doi.org/10.18420/infos2021_k217|Zum Stand der Lehramtsausbildung für einen inklusiven Informatikunterricht]]**\\ //**Kensuke Akao, Johannes Fischer**//\\ INFOS'21, 291-294.
  * **[[https://doi.org/10.4230/LIPIcs.SEA.2021.7|Engineering Predecessor Data Structures for Dynamic Integer Sets]]**\\ //**Patrick Dinklage, Johannes Fischer, Alexander Herlez**//\\ Proceeding of the 19th International Symposium on Experimental Algorithms (SEA 2021), LIPIcs 190, 7:1–7:19. ([[https://arxiv.org/abs/2104.06740|arXiv version]])
  * **[[https://doi.org/10.4230/LIPIcs.ICALP.2021.63|Linear Time Runs Over General Ordered Alphabets]]
**\\ //**Jonas Ellert**, **Johannes Fischer**//\\ Proc. ICALP 2021, LIPIcs 198, 63:1--63:16. ([[https://www.youtube.com/watch?v=bHbXVlb_EJ4|video presentation on YouTube]])
==== 2020 ====
  * **[[http://ceur-ws.org/Vol-2755/paper11.pdf|Fostering Reflection in CS Teacher Education]]**\\ //**Johannes Fischer**, Nora Romahn, **Martin Weinert**//\\ ISSEP (CEURWS Volume) 2020: 128-139.
  * **[[http://ceur-ws.org/Vol-2755/paper3.pdf|To Project or Not to Project: In Search of the Pathway to Object Orientation]]**\\ //**Johannes Fischer, Arno Pasternak**//\\ ISSEP (CEURWS Volume) 2020: 31-42
  * **[[https://doi.org/10.4230/LIPIcs.ESA.2020.39|Practical Performance of Space Efficient Data Structures for Longest Common Extensions]]**\\ //**Patrick Dinklage**, **Johannes Fischer**, **Alexander Herlez**, Tomasz Kociumaka, **Florian Kurpicz**//\\ Proc. ESA, LIPICS 173, Article No. 39; pp. 39:1–39:20.
  * **[[https://dl.acm.org/doi/10.1145/3398681|Deterministic Sparse Suffix Sorting in the Restore Model]]**\\ //**Johannes Fischer, Tomohiro I, Dominik Köppl**//\\ ACM Transactions on Algorithms 16(4), 50.1-50.53.
  * **[[https://doi.org/10.1007/978-3-030-57675-2_21|LCP-Aware Parallel String Sorting]]**\\ //**Jonas Ellert, Johannes Fischer**, Nodari Sitchinava//\\ Proc. Euro-Par, LNCS 12247, 329–342. [[https://www.youtube.com/watch?v=J_Yel_3O72M|(video presentation on YouTube)]]
  * **[[https://doi.org/10.4230/LIPIcs.ICALP.2020.14|Space Efficient Construction of Lyndon Arrays in Linear Time]]**\\ //Philip Bille, **Jonas Ellert, Johannes Fischer**, Inge Li Gørtz, **Florian Kurpicz**, Ian Munro, Eva Rotenberg//\\ Proc. ICALP 2020, LIPIcs 168, 14:1-14.18. [[https://doi.org/10.5446/49401|(video presentation on TIB)]]
  * **[[https://doi.org/10.1137/1.9781611976007.17|Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory]]**\\ //**Patrick Dinklage**, **Johannes Fischer**, **Florian Kurpicz**//\\ Proceedings of the 22nd Workshop on Algorithm Engineering and Experiments (ALENEX 2019), 214-228.

==== 2019 ====
  * **[[http://cyprusconferences.org/issep2019/local-proceedings/|Comparing Approaches for Learning Abstraction and Automation by Object Orientation]]**\\ //**Johannes Fischer**, **Arno Pasternak**// \\ Local Proc. ISSEP, 39--47, 2019.
  * **[[http://www.stringology.org/event/2019/p12.html|Translating Between Wavelet Tree and Wavelet Matrix Construction]]**\\ //**Patrick Dinklage**//\\ Proc. Prague Stringology Conference (PSC 2019), 126--136, 2019.
  * **[[https://doi.org/10.1007/978-3-030-32686-9_28|Parallel External Memory Wavelet Tree and Wavelet Matrix Construction]]**\\ //**Jonas Ellert**, **Florian Kurpicz**//\\ Proceedings of the 26th International Symposium on String Processing and Information Retrieval (SPIRE 2019), LNCS 11811, 407--416.
  * **[[https://doi.org/10.1007/978-3-030-32686-9_29|SACABench: Benchmarking Suffix Array Construction]]**\\ //Johannes Bahne, Nico Bertram, Marvin Böcker, Jonas Bode, **Johannes Fischer**, Hermann Foot, Florian Grieskamp, **Florian Kurpicz**, Marvin Löbel, Oliver Magiera, Rosa Pink, David Piper, and Christopher Poeplau//\\ Proceedings of the 26th International Symposium on String Processing and Information Retrieval (SPIRE 2019), LNCS 11811, 392--406.
  * **[[http://drops.dagstuhl.de/opus/volltexte/2019/11162/pdf/LIPIcs-ESA-2019-41.pdf|Bidirectional Text Compression in External Memory]]** ([[https://arxiv.org/abs/1907.03235|arXiv version]])\\ //**Patrick Dinklage, Jonas Ellert, Johannes Fischer**, Dominik Köppl, Manuel Penschuk//\\ Proc. of the 27th Annual European Symposium on Algorithms (ESA 2019), 41:1-41:16, 2019.
  * **[[https://epubs.siam.org/doi/abs/10.1137/1.9781611975499.3|Lightweight Distributed Suffix Array Construction]]**\\ //**Johannes Fischer**, **Florian Kurpicz**//\\ Proceedings of the 21st Workshop on Algorithm Engineering and Experiments (ALENEX 2019), 27--38, 2019.
  * **[[https://www.sciencedirect.com/science/article/pii/S0304397518304493|Improved Upper Bounds on all Maximal α-gapped Repeats and Palindromes]]** ([[https://arxiv.org/abs/1802.10355|arXiv version]]) \\  //Tomohiro I, **Dominik Köppl**//\\ Theoretical Computer Science, 753: 1--15, 2019.
==== 2018 ====
  * **[[https://link.springer.com/book/10.1007%2F978-3-030-02750-6|Standards for Higher Secondary 
Education for Computer Science in Germany]]**\\ //**Arno Pasternak**, Lutz Hellmig and Gerhard Röhner\\ 
Proceedings ISSEP 2018, St. Petersburg, Russia, October 10-12, 2018, 117--128.\\
//Informatics in Schools. Fundamentals of Computer Science and Software Engineering
  * **[[https://doi.org/10.1109/BigData.2018.8622171|Scalable Construction of Text Indexes with Thrill]]** ([[https://arxiv.org/abs/1610.03007|arXiv version]])\\ //Timo Bingmann, Simon Gog, **Florian Kurpicz**//\\ Proceedings of the IEEE International Conference on Big Data (BigData 2018), 634--643, 2018.
  * **[[http://dx.doi.org/10.1007/s00453-017-0348-7|Lempel-Ziv-78 Compressed String Dictionaries]]** ([[http://rdcu.be/uv3A|Nature SharedIt]]) \\ //Julian Arz, **Johannes Fischer**//\\ Algorithmica, Special Issue on Compact Data Structures, 80(7): 2012--2047, 2018.
  * **[[http://dx.doi.org/10.1007/s00453-017-0333-1|Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees]]** ([[http://rdcu.be/utWN|Nature SharedIt]]) \\ //**Johannes Fischer**, Tomohiro I, **Dominik Köppl**, Kunihiko Sadakane//\\ Algorithmica, Special Issue on Compact Data Structures, 80(7): 2048--2081, 2018.
  * **[[https://doi.org/10.1007/s00224-017-9794-5|Tighter Bounds and Optimal Algorithms for all Maximal α-gapped Repeats and Palindromes]]** ([[http://rdcu.be/u01y|Nature SharedIt]]) \\ //Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, **Dominik Köppl**, Florin Manea//\\ Theory of Computing Systems, 62(1): 162--191, 2018.
  * **[[https://doi.org/10.1137/1.9781611975055.2|Simple, Fast and Lightweight Parallel Wavelet Tree Construction]]** ([[https://arxiv.org/abs/1702.07578|arXiv version]]) \\ //**Johannes Fischer**, **Florian Kurpicz**, **Marvin Löbel**// \\ Proceedings of the 20th Workshop on Algorithm Engineering and Experiments (ALENEX 2018), 9--20, 2018.
  * **[[https://doi.org/10.1016/j.ejc.2017.07.012|Maximum Common Subgraph Problems in Series-Parallel Graphs]]** ([[https://arxiv.org/abs/1708.02772|arXiv version]])\\ //Nils Kriege, **Florian Kurpicz**, Petra Mutzel// \\ European Journal of Combinatorics (Eur. J. Combin.), 68:79--95, 2018.

==== 2017 ====
  * **[[http://www.stringology.org/event/2017/p07.html|Dismantling DivSufSort]]** ([[https://arxiv.org/abs/1710.01896|arXiv version]]) \\ //**Johannes Fischer**, **Florian Kurpicz**// \\ Proceedings of the Prague Stringology Conference (PSC 2017), 62--76.
  * **Modularisierung im Informatikunterricht aus lernpsychologischer Perspektive** \\ //**Johannes Fischer**, **Arno Pasternak** // \\ Proc. INFOS 2017, Lecture Notes in Informatics 274, 247-256.
  * **[[https://doi.org/10.1007/978-3-319-67428-5_16|Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries]]** ([[https://arxiv.org/abs/1706.03035|arXiv version]])\\ //**Johannes Fischer**, **Dominik Köppl**// \\ Proceedings of the 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017), LNCS 9472, 191--207.
  * **[[https://doi.org/10.15439/2017F535|FLOUDS: A Succinct File System Structure]]** \\ //Daniel Peters, **Johannes Fischer**, Florian Thiel, Jean-Pierre Seifert// \\ FedCSIS 2017 Position Papers, 51-57.
  * **[[http://drops.dagstuhl.de/opus/volltexte/2017/7331/pdf/LIPIcs-CPM-2017-15.pdf|Lempel-Ziv Compression in a Sliding Window]]**\\ //Philip Bille, Patrick Hagge Cording, **Johannes Fischer**, Inge Li Gørtz// \\ Proceeding of the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), LIPIcs 78, 15:1–15:11.
  * **[[http://dx.doi.org/10.4230/LIPIcs.CPM.2017.22|Computing All Distinct Squares in Linear Time for Integer Alphabets]]** ([[https://arxiv.org/abs/1610.03421|arXiv version]]) \\ //Hideo Bannai, Shunsuke Inenaga, **Dominik Köppl**// \\  Proceeding of the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), LIPIcs 78, 22:1--22:18. \\
  * **[[http://dx.doi.org/10.4230/LIPIcs.SEA.2017.13|Compression with the tudocomp Framework]]** ([[https://arxiv.org/abs/1702.07577|arXiv version]]) \\ //**Patrick Dinklage**, **Johannes Fischer**, **Dominik Köppl**, **Marvin Löbel**, Kunihiko Sadakane // \\ Proceeding of the 16th International Symposium on Experimental Algorithms (SEA 2017), LIPIcs 75, 13:1--13:22. \\
  * **[[http://dx.doi.org/10.1137/1.9781611974768.10|Engineering a Distributed Full-Text Index]]** ([[https://arxiv.org/abs/1610.03332|arXiv version]])\\ //**Johannes Fischer**, **Florian Kurpicz**, Peter Sanders// \\ Proceedings of the 19th Workshop on Algorithm Engineering and Experiments (ALENEX 2017), 120-134.
==== 2016 ====
  * <html> 
<!-- ACM DL Article: Inducing Suffix and LCP Arrays in External Memory -->
<div class="acmdlitem" id="item2975593"><img src="http://dl.acm.org/images/oa.gif" width="25" height="25" border="0" alt="ACM DL Author-ize service" style="vertical-align:middle"/><a href="http://dl.acm.org/authorize?N30693" title="Inducing Suffix and LCP Arrays in External Memory">Inducing Suffix and LCP Arrays in External Memory</a><div style="margin-left:25px"><a href="http://dl.acm.org/author_page.cfm?id=99658726780" >Timo Bingmann</a>, <a href="http://dl.acm.org/author_page.cfm?id=81321491592" >Johannes Fischer</a>, <a href="http://dl.acm.org/author_page.cfm?id=81322502770" >Vitaly Osipov</a><br />Journal of Experimental Algorithmics (JEA) - Special Issue SEA 2014, Regular Papers and Special Issue ALENEX 2013, 2016</div></div>
    </html>
  * <html>
<!-- ACM DL Article: Sparse Text Indexing in Small Space -->
<div class="acmdlitem" id="item2836166"><img src="http://dl.acm.org/images/oa.gif" width="25" height="25" border="0" alt="ACM DL Author-ize service" style="vertical-align:middle"/><a href="http://dl.acm.org/authorize?N31933" title="Sparse Text Indexing in Small Space">Sparse Text Indexing in Small Space</a><div style="margin-left:25px"><a href="http://dl.acm.org/author_page.cfm?id=81100628534" >Philip Bille</a>, <a href="http://dl.acm.org/author_page.cfm?id=81321491592" >Johannes Fischer</a>, <a href="http://dl.acm.org/author_page.cfm?id=81100550736" >Inge Li G&#248;rtz</a>, <a href="http://dl.acm.org/author_page.cfm?id=81336490330" >Tsvi Kopelowitz</a>, <a href="http://dl.acm.org/author_page.cfm?id=81384606517" >Benjamin Sach</a>, <a href="http://dl.acm.org/author_page.cfm?id=81479660863" >Hjalte Wedel Vildh&#248;j</a><br />ACM Transactions on Algorithms (TALG),&nbsp;2016</div></div>
    </html>
  * **[[http://dx.doi.org/10.4230/LIPIcs.CPM.2016.26|On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching]]** ([[https://arxiv.org/abs/1606.02465|arXiv version]]) \\ //**Johannes Fischer**, **Dominik Köppl**, **Florian Kurpicz**// \\ Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), LIPIcs 54, 2016, 26:1--26:11
  * **[[http://link.springer.com/chapter/10.1007/978-3-662-49529-2_36|Deterministic Sparse Suffix Sorting on Rewritable Texts]]** ([[http://arxiv.org/abs/1509.07417|arXiv version]]) \\ //**Johannes Fischer**, **Tomohiro I**, **Dominik Köppl**// \\ Proceedings of the 12th Latin American Symposium on Theoretical Informatics (LATIN 2016), LNCS  9644, 483-496
  * **[[http://dx.doi.org/10.1109/DCC.2016.38|Lempel Ziv Computation In Compressed Space (LZ-CICS)]]** ([[http://arxiv.org/abs/1510.02882|arXiv version]]) \\ //**Dominik Köppl**, Kunihiko Sadakane// \\ Proceedings of the Data Compression Conference 2016 (DCC 2016), IEEE, 3-12. 
  * **[[http://dx.doi.org/10.1145/2839509.2844592|Contextualized Teaching in the Lower Secondary Education - Long-term Evaluation of a CS Course from Grade 6 to 10]]**\\ //**Arno Pasternak**// \\ Proceedings of the 47th ACM Technical Symposium on Computer Science Education (SIGCSE 2016), ACM Press, 2016, 657-662
  * **[[http://dx.doi.org/10.4230/LIPIcs.STACS.2016.39|Efficiently Finding All Maximal α-gapped Repeats]]** \\ //Pawel Gawrychowski, **Tomohiro I**, Shunsuke Inenaga, **Dominik Köppl**, Florin Manea// \\ Proceedings of the 33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016), LIPIcs 47, 39:1-39:14.
  * **[[http://www.sciencedirect.com/science/article/pii/S1570866715001057|GLOUDS: Representing Tree-Like Graphs]]**\\ //**Johannes Fischer**, Daniel Peters//\\ J. Discrete Algorithms 36: 39-49.

==== 2015 ====
  * **[[http://link.springer.com/chapter/10.1007%2F978-3-662-48971-0_64|Inferring Strings from Full Abelian Periods]]**\\ //Makoto Nishida, **Tomohiro I**, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda// \\ Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC 2015), LNCS  9472, 768-779
  * **[[http://dl.acm.org/citation.cfm?doid=2767124.2716313|Computer Science Education in North-Rhine Westphalia, Germany – A Case Study]]**\\ //Maria Knobelsdorf, Johannes Magenheim, Torsten Brinda, Dieter Engbring, Ludger Humbert, **Arno Pasternak**, Ulrik Schroeder, Marco Thomas, Jan Vahrenhold//\\ ACM Transactions on Computing Education (TOCE) 15(2), Article No. 9
  * **[[http://link.springer.com/chapter/10.1007%2F978-3-319-23826-5_27|Beyond the Runs Theorem]]** ([[http://arxiv.org/abs/1502.04644|arXiv version]])\\ //**Johannes Fischer**, Štěpán Holub, **Tomohiro I**, Moshe Lewenstein//\\ Proceedings of the 22nd Symposium of String Processing and Information Retrieval (SPIRE 2015), LNCS 9309, 277-286
  * **[[http://link.springer.com/chapter/10.1007%2F978-3-662-48350-3_45|Approximating LZ77 via Small-Space Multiple-Pattern Matching]]** ([[http://arxiv.org/abs/1504.06647|arXiv version]])\\ //**Johannes Fischer**, Travis Gagie, Pawel Gawrychowski, Tomasz Kociumaka//\\  Proceedings of the 23rd European Symposium on Algorithms (ESA 2015), LNCS 9294, 533-544
  * **[[http://link.springer.com/chapter/10.1007%2F978-3-319-19929-0_15|Lempel-Ziv Computation in Small Space]]** ([[http://arxiv.org/abs/1504.02605|arXiv version]])\\ //**Johannes Fischer**, **Tomohiro I**, **Dominik Köppl**//\\ Proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015), LNCS 9133, 172-184
  * **[[http://link.springer.com/chapter/10.1007/978-3-319-19929-0_14|Alphabet-Dependent String Searching with Wexponential Search Trees]]** ([[http://arxiv.org/abs/1302.3347|arXiv version]])\\ //**Johannes Fischer**, Pawel Gawrychowski//\\ Proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015), LNCS 9133, 160-171
  * **[[http://link.springer.com/chapter/10.1007%2F978-3-319-23660-5_12|Arithmetics on Suffix Arrays of Fibonacci Words]]**\\ //**Dominik Köppl**, **Tomohiro I**//\\ Proceedings of the 10th International Conference on Combinatorics on Words (WORDS 2015), LNCS 9304, 135-146
  * **[[http://dx.doi.org/10.1137/1.9781611973730.38|A new characterization of maximal repetitions by Lyndon trees]]**\\ //Hideo Bannai, **Tomohiro I**, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta// \\ Proceedings of the 26th ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), 562-571.
  * **[[http://dx.doi.org/10.1007/978-3-319-19929-0_30|Semi-dynamic compact index for short patterns and succinct van Emde Boas tree]]** \\ //Yoshiaki Matsuoka, **Tomohiro I**, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda// \\ Proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015), LNCS 9133, 355-366.
  * **[[http://link.springer.com/chapter/10.1007%2F978-3-319-23826-5_13|A faster algorithm for computing maximal alpha-gapped repeats in a string]]** \\ //Yuka Tanimura, Yuta Fujishige, **Tomohiro I**, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda// \\ Proceedings of the 22nd Symposium on String Processing and Information Retrieval (SPIRE 2015), LNCS 9309, 124-136
  * **[[http://dx.doi.org/10.1016/j.ic.2014.09.009|Detecting regularities on grammar-compressed strings]]** \\ //**Tomohiro I**, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa and Ayumi Shinohara // \\ Information and Computation 240:74-89
  * **[[http://dx.doi.org/10.1016/j.tcs.2015.01.019|Compressed automata for dictionary matching]]** \\ // **Tomohiro I**, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda// \\ Theoretical Computer Science 578:30-41
  * **[[http://dx.doi.org/10.1016/j.ipl.2015.04.002|Constructing LZ78 tries and position heaps in linear time for large alphabets.]]** \\ //Yuto Nakashima, **Tomohiro I**, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda// \\ Information Processing Letters 115(9):655-659
  * **[[http://dx.doi.org/10.1007/978-3-319-15545-6_19|Structured Document Algebra in Action]]** \\ //Don S. Batory, Peter Höfner, **Dominik Köppl**, Bernhard Möller, Andreas Zelend// \\ Structured Document Algebra in Action. Software, Services, and Systems 2015, LNCS 8950, 291-311
  * **[[http://dx.doi.org/10.1007/978-3-319-15612-5_7|A Practical Succinct Data Structure for Tree-Like Graphs]]** \\ //**Johannes Fischer**, Daniel Peters//\\ Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM 2015), LNCS 8973, 65-76
==== 2014 ====
  * **[[http://dx.doi.org/10.1109/DCC.2014.36|LZ-Compressed String Dictionaries]]**\\ //Julian Arz, **Johannes Fischer**//\\ Proc.  of the 24th Data Compression Conference (DCC 2014), 322-331
  * **[[http://dx.doi.org/10.3390/a7040608|High-Order Entropy Compressed Bit Vectors with Rank/Select]]**\\ //Kai Beskers, **Johannes Fischer**//\\ Algorithms 7(4), 608-620
  * **[[http://link.springer.com/chapter/10.1007%2F978-3-662-44465-8_48|Inferring Strings from Lyndon factorization]]**\\ //Yuto Nakashima, Takashi Okabe, **Tomohiro I**, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda//\\ Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), LNCS 8635, Springer, 565-576
  * **[[https://dx.doi.org/10.1007/978-3-319-19315-1_18|On Maximum Common Subgraph Problems in Series-Parallel Graphs]]** \\ //Nils Kriege, **Florian Kurpicz**, Petra Mutzel// \\ Proceedings of the 25th International Workshop on Combinatorial Algorithms (IWOCA 2014), LNCS 8986, Springer, 200-212



===== Other Publications =====
  * **Scalable Text Index Construction**\\ //Timo Bingmann, **Patrick Dinklage, Johannes Fischer**, Florian Kurpicz, Enno Ohlebusch, Peter Sanders//\\ Algorithms for Big Data 2022: 252-284
  * **[[https://www.unterrichtsvideos.net/tagung/viewer/show?file=..%2Fdownloads%2FPoster%2FGruppe_B.pdf#pagemode=bookmarks|Videobasierte Aufgaben im Studium des Informatiklehramts]]**\\ //**Martin Weinert, Johannes Fischer**// \\ Poster, Lehren und Forschen mit Videos in der Lehrkräftebildung, 2021
  * **[[https://www.amazon.de/Mobil-mit-Informatik-M%C3%BCnsteraner-Schulinformatik/dp/375193555X/ref=sr_1_1?__mk_de_DE=%C3%85M%C3%85%C5%BD%C3%95%C3%91&dchild=1&keywords=M%C3%BCnsteraner+Workshop+zur+Schulinformatik&qid=1597830305&s=books&sr=1-1|Wie läuft die Umsetzung inklusiven Informatikunterrichts tatsächlich? Eine Lehrerumfrage zum inklusionsorienterten Unterricht.]]**\\ //**Kensuke Akao, Johannes Fischer**// \\ 9. Münsteraner Workshop für Schulinformatik 2020, 9-18. ISBN 9783751935555.
  * **[[https://dx.doi.org/10.17877/DE290R-21114|Parallel Text Index Construction]]**\\ //**Florian Kurpicz**// \\ PhD-Thesis, 2020.
  * **[[https://dl.gi.de/handle/20.500.12116/28915|Informatik für alle: 18. GI-Fachtagung Informatik und Schule]]**\\ //**Arno Pasternak (Hrsg.)**// \\ Lecture Notes in Informatics 288, Gesellschaft für Informatik, 2019.
  * **[[http://dx.doi.org/10.17877/DE290R-19051|Exploring Regular Structures in Strings]]**\\ //**Dominik Köppl**// \\ PhD-Thesis, 2018.
  * **[[http://dx.doi.org/10.1007/978-3-642-27848-8_640-1|Compressed Range Minimum Queries]]**\\ //**Johannes Fischer**//\\ In Ming-Yang Kao (ed.): Encyclopedia of Algorithms (2nd edition), 379-382, Springer.