Items where Subject is " Theoretische Informatik"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
  • Subjects (90)
    • Theoretische Informatik (90)
Group by: Creators | Category
Jump to: Journal Paper | Paper in Conference Proceedings or in Workshop Proceedings | Book Section/Chapter | Technical Report
Number of items at this level: 90.

Journal Paper

  • On rejected arguments and implicit conflicts: The hidden power of argumentation semantics
    Baumann, Ringo and Dvořák, Wolfgang and Linsbichler, Thomas and Spanring, Christof and Strass, Hannes and Woltran, Stefan Artificial Intelligence , 241. 244 - 284 ISSN 0004-3702 (2016)

  • Welfare Maximization with Friends-of-Friends Network Externalities
    Bhattacharya, Sayan and Dvořák, Wolfgang and Henzinger, Monika and Starnberger, Martin Theory of Computing Systems. pp. 1-39 ISSN 1432-4350 Springer US (2017)

  • Preferred semantics as socratic discussion
    Caminada, Martin and Dvořák, Wolfgang and Vesic, Srdjan ISSN 0955-792X Oxford Journals (2014)

  • On the equivalence between logic programming semantics and argumentation semantics
    Caminada, Martin and Sá, Samy and Alcântara , João and Dvořák, Wolfgang International Journal of Approximate Reasoning , 58. pp. 87-111 ISSN 0888-613X (2014)

  • Methods for Solving Reasoning Problems in Abstract Argumentation - A Survey
    Charwat, Günther and Dvořák, Wolfgang and Gaggl, Sarah Alice and Wallner, Johannes Peter and Woltran, Stefan pp. 28-63 ISSN 0004-3702 Elsevier (2015)

  • Approximating the minimum cycle mean
    Chatterjee, Krishnendu and Henzinger, Monika and Krinninger, Sebastian and Loitzenbauer, Veronika and Raskin, Michael A. pp. 104-116 ISSN 0304-3975 (2014)

  • Polynomial-Time Algorithms for Energy Games with Special Weight Structures
    Chatterjee, Krishnendu and Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon pp. 457-492 ISSN 0178-4617 (2014)

  • Characteristics of multiple viewpoints in abstract argumentation
    Dunne, Paul E. and Dvořák, Wolfgang and Linsbichler, Thomas and Woltran, Stefan Artificial Intelligence , 228. pp. 153-178 ISSN 0004-3702 Elsevier (2015)

  • Parametric Properties of Ideal Semantics
    Dunne, Paul E. and Dvořák, Wolfgang and Woltran, Stefan Artificial Intelligence, 202. pp. 1-28 ISSN 0004-3702 Elsevier (2013)

  • Stage semantics and the SCC-recursive schema for argumentation semantics
    Dvořák, Wolfgang and Gaggl, Sarah Alice ISSN 0955-792X Oxford Journals (2014)

  • Maximizing a Submodular Function with Viability Constraints
    Dvořák, Wolfgang and Henzinger, Monika and Williamson, David P. ISSN 0178-4617 Springer US (2015)

  • Complexity-Sensitive Decision Procedures for Abstract Argumentation.
    Dvořák, Wolfgang and Järvisalo, Matti and Wallner, Johannes Peter and Woltran, Stefan Artificial Intelligence, 206. pp. 53-78 ISSN 0004-3702 Elsevier (In Press) (2014)

  • Comparing the expressiveness of argumentation semantics
    Dvořák, Wolfgang and Spanring, Christof ISSN 0955-792X (2016)

  • Faster Algorithms for Semi-Matching Problems
    Fakcharoenphol, Jittat and Laekhanukit, Bundit and Nanongkai, Danupon ACM Transactions on Algorithms, 10 (3). pp. 1-23 ISSN 1549-6325 (2014)

  • Charting Collaboration Support in Agile Business Networks
    Grefen, Paul and Rinderle-Ma, Stefanie and Dustdar, Schahram and Fdhila, Walid and Mendling, Jan and Schulte, Stefan ISSN 1089-7801 (2017)

  • Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon pp. 947-1006 ISSN 0097-5397 (2016)

  • Validity in a logic that combines supervaluation and fuzzy logic based theories of vagueness
    Krinninger, Sebastian pp. 1-17 ISSN 0165-0114 (2014)

  • Finding near-optimal independent sets at scale
    Lamm, Sebastian and Sanders, Peter and Schulz, Christian and Strash, Darren and Werneck, Renato F. J. Heuristics, 23 (4). pp. 207-229 ISSN 1381-1231 (2017)

  • Parallel Graph Partitioning for Complex Networks
    Meyerhenke, Henning and Sanders, Peter and Schulz, Christian IEEE Trans. Parallel Distrib. Syst., 28 (9). pp. 2625-2638 ISSN 1045-9219 (2017)

  • Equivalence of Granger Causality and Transfer Entropy: A Generalization.
    Schindlerova, Katerina 3637 -3648 ISSN 1314-7552 Applied Mathematical Sciences, Hikari (2011)

  • Causality detection based on information-theoretic approaches in time series analysis.
    Schindlerova, Katerina and Palus, Milan and Vejmelka, Martin and Bhattacharya, Joydeep pp. 1-46 ISSN 0370-1573 Elsevier (2007)

  • Evaluating Transfer Entropy for Normal and γ-Order Normal Distributions.
    Schindlerova, Katerina and Toulias, Thomas and Kitsos, Christos pp. 1-20 ISSN 2231-0851 SCIENCEDOMAIN international (2016)

    • Paper in Conference Proceedings or in Workshop Proceedings

  • Compact Argumentation Frameworks.
    Baumann, Ringo and Dvořák, Wolfgang and Linsbichler, Thomas and Strass, Hannes and Woltran, Stefan In: 21st European Conference on Artificial Intelligence , 18-22 Aug. , Prague, Czech Republic (2014)

  • Compact Argumentation Frameworks.
    Baumann, Ringo and Dvořák, Wolfgang and Linsbichler, Thomas and Strass, Hannes and Woltran, Stefan In: 15th International Workshop on Non-Monotonic Reasoning , 17–19 July 2014 , Vienna (2014)

  • Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
    Becker, Ruben and Karrenbauer, Andreas and Krinninger, Sebastian and Lenzen, Christoph In: 31st International Symposium on Distributed Computing (DISC 2017) , October 17–19, 2017 , Vienna (2017)

  • Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time
    Bhattacharya, Sayan and Chakrabarty, Deeparnab and Henzinger, Monika In: 19th Conference on Integer Programming and Combinatorial Optimization , June 26 - 28, 2017 , Waterloo, Canada (2017)

  • Welfare Maximization with Friends-of-Friends Network Externalities
    Bhattacharya, Sayan and Dvořák, Wolfgang and Henzinger, Monika and Starnberger, Martin In: 32nd Symposium on Theoretical Aspects of Computer Science (STACS 2015) , March, 4 - 7 2015 , Munich, Germany (2015)

  • Design of Dynamic Algorithms via Primal-Dual Method
    Bhattacharya, Sayan and Henzinger, Monika and Italiano, Giuseppe F. In: 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) , July 6–10, 2015 , Kyoto, Japan (2015)

  • Fully Dynamic Maximum Matching and Vertex Cover in O(log^3 n) Worst Case Update Time
    Bhattacharya, Sayan and Henzinger, Monika and Nanongkai, Danupon In: Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms 2017 , January 16-19, 2017 , Barcelona, Spain (2017)

  • Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs
    Bringmann, Karl and Hansen, Thomas Dueholm and Krinninger, Sebastian In: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) , July 10–14 2017 , Warsaw (2017)

  • Brief Announcement: A Note on Hardness of Diameter Approximation
    Bringmann, Karl and Krinninger, Sebastian In: 31st International Symposium on Distributed Computing (DISC 2017) , October 17–19, 2017 , Vienna (2017)

  • On the Difference between Assumption-Based Argumentation and Abstract Argumentation
    Caminada, Martin and Sá, Samy and Alcântara , João and Dvořák, Wolfgang In: 25th Belgium-Netherlands Artificial Intelligence Conference (BNAIC 2013) , 7-8 Nov 2013 , Delft, Netherlands (2013)

  • Pre-Reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs
    Chalermsook, Parinya and Laekhanukit, Bundit and Nanongkai, Danupon In: 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2014) , October 18-21, 2014 , Philadelphia, USA (2014)

  • Conditionally Optimal Algorithms for Generalized Büchi Games
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika and Loitzenbauer, Veronika In: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) , August 22-26, 2016 , Krakow (Poland) (2016)

  • Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika and Loitzenbauer, Veronika In: Thirty-First Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) , July 5-8, 2016 , New York City, USA (2016)

  • Approximating the minimum cycle mean
    Chatterjee, Krishnendu and Henzinger, Monika and Krinninger, Sebastian and Loitzenbauer, Veronika In: Fourth International Symposion on Games, Automata, Logics and Formal Verification (GandALF 2013) , 29 - 31 Aug 2013 , Borca di Cadore, Dolomites, Italy (2013)

  • Polynomial-time Algorithms for Energy Games with Special Weight Structures
    Chatterjee, Krishnendu and Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 20th Annual European Symposium on Algorithms (ESA 2012) , 10-12 Sep 2012 , Ljubljana, Slovenia (2012)

  • Improved Algorithms for One-Pair and k-Pair Streett Objectives
    Chatterjee, Krishnendu and Henzinger, Monika and Loitzenbauer, Veronika In: Thirtieth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS) , July 6–10, 2015 , Kyoto, Japan (2015)

  • Faster Algorithms for Mean-Payoff Parity Games
    Chatterjee, Krishnendu and Henzinger, Monika and Svozil, Alexander In: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS) 2017 , 21-25 August 2017 , Aalborg, Denmark (2017)

  • Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs
    Chechik, Shiri and Hansen, Thomas Dueholm and Italiano, Giuseppe F. and Loitzenbauer, Veronika and Parotsidis, Nikos In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2017) , 16-19 Jan 2017 , Barcelona, Spain (2017)

  • Better Strategyproof Mechanisms without Payments or Prior --- An Analytic Approach
    Cheung, Yun Kuen In: International Joint Conference on Artificial Intelligence , 9--15 July, 2016 , New York, USA (2016)

  • Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds
    Cheung, Yun Kuen and Goranci, Gramoz and Henzinger, Monika In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) , 12-15 July 2016 , Rome, Italy (2016)

  • Limiting Price Discrimination when Selling Products with Positive Network Externalities
    Cigler, Luděk and Dvořák, Wolfgang and Henzinger, Monika and Starnberger, Martin In: WINE 2014: The 10th Conference on Web and Internet Economics , Dec. 14-17 , Bejing, China (2014)

  • Plausibility Checking of Formal Business Process Specifications in Linear Temporal Logic (Extended Abstract)
    Czepa, Christoph and Tran, Huy and Zdun, Uwe and Tran, Thanh and Weiss, Erhard and Ruhsam, Christoph In: 7th International Workshop on Enterprise Modeling and Information Systems Architectures (EMISA 2016) , 3-5 Oct 2016 , Vienna, Austria (2016)

  • Reduction Techniques for Efficient Behavioral Model Checking in Adaptive Case Management
    Czepa, Christoph and Tran, Huy and Zdun, Uwe and Tran, Thanh and Weiss, Erhard and Ruhsam, Christoph In: The 32nd ACM Symposium on Applied Computing (SAC 2017) , 3-6 Apr 2017 , Marrakesh, Morocco (2017)

  • Distributed verification and hardness of distributed approximation
    Das Sarma, Atish and Holzer, Stephan and Kor, Liah and Korman, Amos and Nanongkai, Danupon and Pandurangan, Gopal and Peleg, David and Wattenhofer, Roger In: STOC '11 Proceedings of the 43rd annual ACM symposium on Theory of computing , 2011, June 4-11 , San Jose, CA, USA (2011)

  • Characteristics of Multiple Viewpoints in Abstract Argumentation
    Dunne, Paul E. and Dvořák, Wolfgang and Linsbichler, Thomas and Woltran, Stefan In: 4th Workshop on Dynamics of Knowledge and Belief (DKB-2013) (2013)

  • Characteristics of Multiple Viewpoints in Abstract Argumentation
    Dunne, Paul E. and Dvořák, Wolfgang and Linsbichler, Thomas and Woltran, Stefan In: 14th International Conference on Principles of Knowledge Representation and Reasoning , 2014-07-20 - 2014-07-24 , Vienna (2014)

  • Online Ad Assignment with an Ad Exchange
    Dvořák, Wolfgang and Henzinger, Monika In: Workshop on Approximation and Online Algorithms , September 11–12 , Wroclaw, Poland (2015)

  • Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract)
    Dvořák, Wolfgang and Järvisalo, Matti and Wallner, Johannes Peter and Woltran, Stefan In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015 , July 25-31, 2015 , Buenos Aires, Argentina (2015)

  • Resolution-based grounded semantics revisited.
    Dvořák, Wolfgang and Linsbichler, Thomas and Oikarinen, Emilia and Woltran, Stefan In: Fifth International Conference on Computational Models of Argument , September 9th - 12th , Scottish Highlands (2014)

  • Predicting Change Propagation Impacts in Collaborative Business processes
    Fdhila, Walid and Rinderle-Ma, Stefanie In: The 29th ACM Symposium on Applied Computing (SAC) - Enterprise Engineering , March 24-28 , 2014 , Gyeongju, Korea (2014)

  • On Evolving Partitioned Web Service Orchestrations
    Fdhila, Walid and Rinderle-Ma, Stefanie and Baouab, Aymen and Perrin, Olivier and Godart, Claude In: The 5th International Conference on Service-oriented computing and Applications (SOCA 2012) , 17-19 Dec 2012 , taipei, Taiwan (In Press) (2012)

  • Decremental Data Structures for Connectivity and Dominators in Directed Graphs
    Georgiadis, Loukas and Hansen, Thomas Dueholm and Italiano, Giuseppe F. and Krinninger, Sebastian and Parotsidis, Nikos In: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) , July 10–14 2017 , Warsaw (2017)

  • Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time
    Goranci, Gramoz and Henzinger, Monika and Thorup, Mikkel In: 24th Annual European Symposium on Algorithms (ESA 2016) , 22-26 Aug 2016 , Aarhus, Denmark (2016)

  • Vertex Sparsification in Trees
    Goranci, Gramoz and Räcke, Harald In: 14th Workshop on Approximation and Online Algorithms (WAOA) 2016 , August 25-26, 2016 , Aarhus, Denmark (2016)

  • Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
    Henzinger, Monika and Krinninger, Sebastian and Loitzenbauer, Veronika In: 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) , July 6–10, 2015 , Kyoto, Japan (2015)

  • Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2014) , October 18-21, 2014 , Philadelphia, USA (2014)

  • A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: STOC 2016: 48th Annual Symposium on the Theory of Computing , 19-21 Jun 2016 , Cambridge, MA, USA (2016)

  • Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: FOCS 2013 54th Annual IEEE Symposium on Foundations of Computer Science , October 27-29, 2013 , Berkeley, USA (In Press) (2013)

  • Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 46th ACM Symposium on Theory of Computing (STOC 2014) , June 1 – June 3, 2014 , New York, NY, USA (2014)

  • Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 40th International Colloquium on Automata, Languages and Programming (ICALP 2013) , 8-12 July 2013 , Riga, Latvia (In Press) (2013)

  • A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 25th ACM-SIAM Symposium on Discrete Algorithms (SODA14) , January 5-7, 2014 , Portland, USA (In Press) (2014)

  • Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon and Saranurak, Thatchaphol In: 47th ACM Symposium on Theory of Computing (STOC 2015) , June 14 - June 17 , Portland, OR, USA (2015)

  • Conditional Hardness for Sensitivity Problems
    Henzinger, Monika and Lincoln, Andrea and Neumann, Stefan and Vassilevska Williams, Virginia In: 8th Innovations in Theoretical Computer Science (ITCS) 2017 , 9-11 Jan 2017 , Berkeley, California, United States of America (2017)

  • Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
    Henzinger, Monika and Nanongkai, Danupon and Krinninger, Sebastian In: 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) , July 6–10, 2015 , Kyoto, Japan (2015)

  • Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning
    Henzinger, Monika and Neumann, Stefan In: 24th Annual European Symposium on Algorithms (ESA 2016) , 22-26 Aug 2016 , Aarhus, Denmark (2016)

  • Local Flow Partitioning for Faster Edge Connectivity
    Henzinger, Monika and Rao, Satish and Wang, Di In: Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms 2017 , January 16-19, 2017 , Barcelona, Spain (2017)

  • Multi-parameter mechanism design under budget and matroid constraints
    Henzinger, Monika and Vidali, Angelina In: 19th Annual European Symposium on Algorithms (ESA 2011) , September 5-9, 2011 , Saarbruecken, Germany (In Press) (2011)

  • Distributed Symmetry Breaking in Hypergraphs
    Kutten, Shay and Nanongkai, Danupon and Pandurangan, Gopal and Robinson, Peter In: 28th International Symposium on Distributed Computing 2014 , 12-15 October 2014 , Austin, Texas, USA (2014)

  • Graph Partitioning with Acyclicity Constraints
    Moreira, Orlando and Popp, Merten and Schulz, Christian In: 16th Symposium on Experimental Algorithms (SEA) 2017 , June 21–23, 2017 , London, UK (2017)

  • A tight unconditional lower bound on distributed randomwalk computation
    Nanongkai, Danupon and Das Sarma, Atish and Pandurangan, Gopal In: PODC '11 Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing , 2011, June 4-11 , San Jose, CA, USA (2011)

  • Almost-Tight Distributed Minimum Cut Algorithms
    Nanongkai, Danupon and Su, Hsin-Hao In: 28th International Symposium on Distributed Computing 2014 , 12-15 October 2014 , Austin, Texas, USA (2014)

  • What You Will Gain By Rounding: Theory and Algorithms for Rounding Rank
    Neumann, Stefan and Gemulla, Rainer and Miettinen, Pauli In: 16th IEEE International Conference on Data Mining 2016 (ICDM'16) , 12-15 December 2016 , Barcelona (2016)

  • Reductions for Frequency-Based Data Mining Problems
    Neumann, Stefan and Miettinen, Pauli In: 17th IEEE International Conference on Data Mining 2017 (ICDM'17) , 18-21 Nov 2017 , New Orleans (2017)

  • This House Proves That Debating Is Harder Than Soccer
    Neumann, Stefan and Wiese, Andreas In: Eighth International Conference on Fun with Algorithms (FUN 2016) , June 8 – 10, 2016 , La Maddalena, Maddalena Islands, Italy (2016)

  • How Paradoxical is the "Paradox of Side Payments"? Notes from a Network Interconnection Perspective.
    Reichl, Peter and Zwickl, Patrick and Löw, Christian and Maillé, Patrick In: 11th International Conference on Wired/Wireless Internet Communications (WWIC’13) , June 5 - 7, 2013 , St. Petersburg (2013)

  • Distributed evolutionary k-way node separators
    Sanders, Peter and Schulz, Christian and Strash, Darren and Williger, Robert In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017 , July 15-19 2017 , Berlin, Germany (2017)

  • Better Process Mapping and Sparse Quadratic Assignment Problems
    Schulz, Christian and Träff, Jesper Larsson In: 16th Symposium on Experimental Algorithms (SEA) 2017 , June 21–23, 2017 , London, UK (2017)

  • Distributed QR Factorization Based on Randomized Algorithms
    Strakova, Hana and Gansterer, Wilfried and Zemen, T. In: 9th International Conference on Parallel Processing and Applied Mathematics (PPAM) 2011 , 11-14 Sep 2011 , Torun, Poland (2011)

  • Capacity Releasing Diffusion for Speed and Locality
    Wang, Di and Fountoulakis, Kimon and Henzinger, Monika and Mahoney, Michael W. and Rao, Satish In: Thirty-fourth International Conference on Machine Learning 2017 , 06-11 Aug 2017 , Sydney, Australia (2017)

  • Graph-Theoretic Roots of Value Network Quantification
    Zwickl, Patrick and Reichl, Peter In: 19th EUNICE Workshop on Advances in Communication Networking , August 2013 , Chemnitz (2013)

    • Book Section/Chapter

  • Computationale Aspekte der Abstrakten Argumentation.
    Dvořák, Wolfgang In: Ausgezeichnete Informatikdissertationen 2012. Lecture Notes in Informatics (LNI) (D-13) Bonner Köllen Verlag, pp. 61-70 ISBN 978-3-88579-417-2 (2013)

  • Reduction-Based Approaches to Implement Modgil's Extended Argumentation Frameworks
    Dvořák, Wolfgang and Gaggl, Sarah Alice and Linsbichler, Thomas and Wallner, Johannes Peter In: Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation. Lecture Notes in Computer Science, 9060 Springer International Publishing, pp. 249-264 (2015)

  • Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems.
    Dvořák, Wolfgang and Gaggl, Sarah Alice and Wallner, Johannes Peter and Woltran, Stefan In: Applications of Declarative Programming and Knowledge Management Applications of Declarative Programming and Knowledge Management. Lecture Notes in Computer Science (7773) Springer Berlin Heidelberg, pp. 114-133 ISBN 978-3-642-41523-4 (2013)

  • dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation
    Dvořák, Wolfgang and Morak, Michael and Nopp, Clemens and Woltran, Stefan In: Applications of Declarative Programming and Knowledge Management. Lecture Notes in Computer Science (7773) Springer Berlin Heidelberg, pp. 259-268 ISBN 978-3-642-41523-4 (2013)

  • PageRank Algorithm
    Henzinger, Monika In: Encyclopedia of Algorithms. Springer, pp. 1509-1511 (2016)

  • Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: Encyclopedia of Algorithms. Springer, pp. 600-602 (2016)

    • Technical Report

  • A systematic literature review on process model testing: Approaches, challenges, and research directions
    Böhmer, Kristof and Rinderle-Ma, Stefanie Technical Report. arXiv.org (2015)

  • CEGARTIX v0.4: A SAT-Based Counter-Example Guided Argumentation Reasoning Tool
    Dvořák, Wolfgang and Järvisalo, Matti and Wallner, Johannes Peter and Woltran, Stefan Other. UNSPECIFIED (2015)

    • This list was generated on Wed Sep 20 14:39:36 2017 CEST.
    Universität Wien| Fakultät für Informatik | Währinger Straße 29 | 1090 Wien | T +43-1-4277-780 01 | Imprint | Webteam
    EPrints Logo
    CS is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.