Forschungsbereich Algorithms and Complexity

Organization Name (de) Name der Organisation (de)
E192-01 - Forschungsbereich Algorithms and Complexity
 
Code Kennzahl
E192-01
 
Type of Organization Organisationstyp
Research Division
Parent OrgUnit Übergeordnete Organisation
 
Active Aktiv
 


Results 1-20 of 187 (Search time: 0.005 seconds).

PreviewAuthor(s)TitleTypeIssue Date
1Binucci-2024-Journal of Computer and System Sciences-vor.pdf.jpgBinucci, Carla ; Di Giacomo, Emilio ; Lenhart, William ; Liotta, Giuseppe ; Montecchiani, Fabrizio ; Nöllenburg, Martin ; Symvonis, Antonios On the complexity of the storyplan problemArticle Artikel Feb-2024
2Ekstein, Jan ; Fleischner, Herbert The most general structure of graphs with hamiltonian or hamiltonian connected squareArticle Artikel 1-Jan-2024
3Ganian, Robert ; Hamm, Thekla ; Knop, Dušan ; Schierreich, Šimon ; Suchý, Ondřej Hedonic diversity games: A complexity picture with more than two colorsArticle Artikel Dec-2023
4Schidler-2023-ACM Journal on Experimental Algorithmics-vor.pdf.jpgSchidler, Andre ; Szeider, Stefan SAT-boosted tabu search for coloring massive graphsArticle Artikel Dec-2023
5Schidler-2023-Artificial Intelligence-vor.pdf.jpgSchidler, André ; Szeider, Stefan Computing optimal hypertree decompositions with SATArticle Artikel Dec-2023
6Peitl-2023-Discrete Applied Mathematics-vor.pdf.jpgPeitl, Tomáš ; Szeider, Stefan Are hitting formulas hard for resolution?Article Artikel 15-Oct-2023
7Dreier-2023-Constraints-vor.pdf.jpgDreier, Jan ; Ordyniak, Sebastian ; Szeider, Stefan CSP beyond tractable constraint languagesArticle Artikel Sep-2023
8Bhore-2023-ACM Transactions on Spatial Algorithms and Systems-vor.pdf.jpgBhore, Sujoy ; Ganian, Robert ; Li, Guangping ; Nöllenburg, Martin ; Wulms, Jules Worbel: aggregating point labels into word cloudsArticle Artikel Sep-2023
9Wallinger-2023-Computer Graphics Forum-vor.pdf.jpgWallinger, Markus ; Archambault, Daniel ; Auber, David ; Nöllenburg, Martin ; Peltonen, Jaakko Faster edge‐path bundling through graph spannersArticle Artikel Sep-2023
10Wallinger, Markus ; Dobler, Alexander ; Nöllenburg, Martin LinSets.zip: Compressing Linear Set DiagramsArticle Artikel 1-Jun-2023
11Eiben, Eduard ; Ganian, Robert ; Kanj, Iyad ; Ordyniak, Sebastian ; Szeider, Stefan On the parameterized complexity of clustering problems for incomplete dataArticle Artikel Jun-2023
12Limmer-2023-Energies-vor.pdf.jpgLimmer, Steffen ; Varga, Johannes ; Raidl, Günther Large neighborhood search for electric vehicle fleet schedulingArticle Artikel Jun-2023
13Fichte-2023-Communications of the ACM-vor.pdf.jpgFichte, Johannes K. ; Le Berre, Daniel ; Hecher, Markus ; Szeider, Stefan The silent (r)evolution of SATArticle Artikel Jun-2023
14Ganian, Robert ; Ordyniak, Sebastian ; Rahul, C. S. Group Activity Selection with Few Agent TypesArticle Artikel May-2023
15Bhore, Sujoy ; Da Lozzo, Giordano ; Montecchiani, Fabrizio ; Nöllenburg, Martin On the upward book thickness problem: Combinatorial and complexity resultsArticle Artikel May-2023
16Bhore-2023-Computational Geometry-vor.pdf.jpgBhore, Sujoy ; Li, Guangping ; Nöllenburg, Martin ; Rutter, Ignaz ; Wu, Hsiang-Yun Untangling circular drawings: Algorithms and complexityArticle Artikel Apr-2023
17Iurlano-2022-Designs, Codes and Cryptography-vor.pdf.jpgIurlano, Enrico Growth of the perfect sequence covering array numberArticle Artikel Apr-2023
18Angelini-2023-Algorithmica-vor.pdf.jpgAngelini, Patrizio ; Bekos, Michael A. ; Förster, Henry ; Gronemann, Martin Bitonic st-orderings for upward planar graphs: splits and bends in the variable embedding scenarioArticle Artikel 11-Mar-2023
19Chaplick-2023-Computing in Geometry and Topology-am.pdf.jpgChaplick, Steven ; Cornelsen, Sabine ; Nöllenburg, Martin ; Tollis, Ioannis G. ; Chimani, Markus ; Da Lozzo, Giordano ; Patrignani, Maurizio ; Wolf, Alexander Planar L-drawings of directed graphsArticle Artikel 23-Feb-2023
20Eiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; Ordyniak, Sebastian Parameterized complexity of envy-free resource allocation in social networksArticle Artikel Feb-2023