Search for

Bibliographia Humboldtiana Index

Bibliographia Humboldtiana

III. Publications by Research Awardees

Computer science, information science, statistics

Boerger, Prof. Dr. Egon

Universita di Pisa, Italy
Field of research: Applied computer science, applied information science
Host: Prof. Dr. Bernhard Thalheim Christian-Albrechts-Universität zu Kiel
  • Egon Boerger and Bernhard Thalheim: A Method for Verifiable and Validatable Business Process Modeling. In: Advances in Software Engineering (LNCS 5316). (Ed. Egon Boerger and Antonio Cisternino) Berlin, Heidelberg, New York etc.: Springer-Verlag, 2008, p. 59 - 115 [Business Process Modeling, Abstract State Machine, BPMN].

  • Egon Boerger and Bernhard Thalheim: Modeling Workflows, Interaction Patterns, Web Services and Business Processes: The ASM-Based Approach. In: Abstract State Machines, B and Z (LNCS 5238) . (Ed. Egon Boerger and Michael Butler and Jonathan Bowen and Paul Boca) Berlin, Heidelberg, New York, etc.: Springer-Verlag , 2008, p. 24 - 38 [Workflows, Web Services, Interaction Patterns, Business Processes, Abstract State Machines, ].

  • Egon Boerger Owe Soerensen Bernhard Thalheim: On defining the behavior of OR-joins in business process models. In: J. Universal Computer Science. 14, 2008, p. 1 - 22 [BPMN, OR-Join Problem, Synchronization of Parallel Workflows].

  • Egon Boerger and and Ove Soerensen: BPMN Core Modeling Concepts: Inheritance-Based Execution Semantics. In: Handbook of conceptual modelling. (Ed. D. Embley and B. Thalheim) Berlin Heidelberg New York etc.: Springer-Verlag, 2010, p. 1 - 46 [Business Process Modelling Notation, Abstract State Machines].

  • Michael Altenhofen, Egon Boerger: Concurrent Abstract State Machines and +CAL. In: Recent Trends in Algebraic Development Techniques (WADT 2008) (LNCS 5486). (Ed. A. Corradini and U. Montanari) Berlin, Heidelberg, New York: Springer, 2009, p. 1 - 17 [Abstract State Machines, concurrency, +CAL].

  • Egon Boerger: Approaches to Modeling Business Processes. A Critical Analysis of BPMN, Workflow Patterns and YAWL. In: J. SOFTWARE AND SYSTEMS MODELING. 11 (3), 2012, p. 305 - 318 [Business Process Modeling, BPMN, YAWL, Workflow Pattern, Petri nets].

  • Egon Boerger: The Subject-Oriented Approach to Software Design and the {A}bstract {S}tate {M}achines Method. In: Conceptual Modelling and Its Theoretical Foundations -- Essays Dedicated to Bernhard Thalheim on the Occasion of his 60th Birthday. (Ed. A. Duesterhoeft and M. Klettke and K.-D. Schewe) Berlin etc.: Springer, 2012, p. 52 - 72 [Business Procdess Modeling, S-BPM, Abstract State Machines].

  • Albert Fleischmann, W. Schmidt, C. Stary, Stefan Obermeier,Egon Boerger: Subjektorientiertes Prozessmanagement. Muenchen: Hanser, 2011, 434 pp. [S-BPM].

  • A. Fleischmann, W. Schmidt, C. Stary, S. Obermeier,Egon Boerger: Subject-Oriented Business Process Management. Berlin etc.: Springer Open Access Book, 2012, XV+375 pp. Original author: A. Fleischmann, W. Schmidt, C. Stary, S. Obermeier, E. Boerger (English) [S-BPM].

  • Egon Boerger, K.-D. Schewe: Specifying Transaction Control to Serialize Concurrent Program Executions. In: Proc. ABZ 2014 (LNCS 8477). (Ed. Y. Ait-Ameur, K.-D. Schewe) Berlin etc.: Springer, 2014, p. 142 - 157 [Transaction, Databses, Abstract State Machines].

  • Egon Boerger, Albert Fleischmann: Abstract State Machine Nets. Closing the Gap between Business Process Models and their Implementation . In: Proc. S-BPM ONE 2015. (Ed. Jens Ehlers, Bernhard Thalheim) USA: ACM Digital Library, 2015.

  • Egon Boerger, Simone Zenzaro: Modeling for Change via Component-Based Decomposition and ASM Refinement . In: Proc.S-BPM ONE 2015. (Ed. Jens Ehlers, Bernhard Thalheim) USA: ACM Digital Library, 2015.

Boncz, Dr. Peter

Centrum voor Wiskunde en Informatica (CWI), Netherlands
Field of research: Computer and information science
Host: Prof. Dr. Alfons Kemper Technische Universität München
  • Harald Lang, Tobias Mühlbauer, Florian Funke, Peter Boncz, Thomas Neumann, Alfons Kemper: Data Blocks: Hybrid OLTP and OLAP on Compressed Storage using both Vectorization and Compilation. In: Proceedings of ACM SIGMOD. 2016, p. 1 - 12.

  • Minh Duc Pham, Linnea Passing, Orri Erling, Peter Boncz : Deriving an Emergent Relational Schema from RDF data . In: Proceedings of the WWW Conference. 2015, p. 1 - 12.

  • Orri Erling, Alex Averbuch, Josep Lluis Larriba-Pey, Hassan Chafi, Andrey Gubichev, Arnau Prat, Minh Duc Pham, Peter Boncz : The LDBC Social Network Benchmark: Interactive Workload. . In: Proceedings of the ACM SIGMOD Conference. 2015, p. 1 - 12.

  • Viktor Leis, Andrey Gubichev, Atanas Mirchev, Peter Boncz, Thomas Neumann, Alfons Kemper.: How Good Are Query Optimizers, Really? . In: Proceedings of the VLDB (PVLDB). 9, 2015, p. 204 - 215.

  • Andrey Gubichev, Peter Boncz: Parameter Curation for Benchmark Queries. In: Proceedings of the Technical Conference of the Transaction Processing Council (TPCTC). 2014, p. 1 - 12.

  • Renzo Angles Rojas, Peter Boncz, Josep LLuis Larriba-Pey, Irini Fundulaki, Thomas Neumann, Orri Erling, Peter Neubauer, Norbert Martinez Bazan, Venelin Kotsev, Ioan Toma: The Linked Data Benchmark Council: a Graph and RDF industry benchmarking effort. In: ACM SIGMOD Record . 43, 2014, p. 27 - 31.

  • Viktor Leis, Peter Boncz, Alfons Kemper, Thomas Neumann. : Morsel-Driven Parallelism: A NUMA-Aware Query Evaluation Framework for the Many-Core Age. In: Proceedings of SIGMOD. 2014, p. 1 - 12.

El Saddik, Prof. Dr. Abdulmotaleb

University of Ottawa, Canada
Field of research: Applied computer science, applied information science
Host: Prof. Dr. Ralf Steinmetz Technische Universität Darmstadt
  • Abdulmotaleb El Saddik, Mauricio Orozco, Mohammad Eid, Jongeun Cha: Haptics Technologies: Bringing Touch to Multimedia. Springer-Verlag, 2011, 218 pp. [HCI – Human-Computer Interaction - Haptics - Rendering Systems - Robotics - User Interfaces - VR – Virtual Reality].

Fellows, Prof. Dr. Michael Ralph

University of Bergen, Norway
Field of research: Theoretical computer and information science
Host: Prof. Dr. Rolf Niedermeier Friedrich-Schiller-Universität Jena
  • Michael Dom, Michael R. Fellows, Frances A. Rosamond: Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. In: Lecture Notes in Computer Science: Proc 3rd WALCOM Confe. 5431, 2009, p. 298 - 309 [Parameterized Complexity Algorithm design Computational Complexity Theoretical Computer Science Rectangle Stabbing Embedded sensor networks Radiotherapy Spatial Data Organization].

  • Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Generalization of Nemhauser and Trotter's Local Optimization Theorem. In: STACS. 2009, p. 409 - 420 [Parameterized Complexity Algorithm design Computational Complexity Theoretical Computer Science Optimization].

  • Michael Ralph Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Generalization of Nemhauser and Trotter's Local Optimization Theorem. In: STACS Proceedings 2009. 2009, p. 409 - 420 [Parameterized complexity Optimization Algorithm design Computational complexity Theoretical Computer Science].

  • Michael Ralph Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette: On the parameterized complexity of multiple-interval graph problems. In: Theoretical Computer Science. 410(1), 2009, p. 53 - 61 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Applications to high throughput genotyping, and to scheduling RAM and processor time for multiple real-time programs on multi-tasking. ].

  • Michael R. Fellows, Henning Fernau: Facility Location Problems: A Parameterized View. In: AAIM 2008. 2008, p. 188 - 199 [rized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Facilities Location].

  • Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos: Derivation of algorithms for cutwidth and related graph layout parameters. In: Journal Computation System Science. 75(4), 2009, p. 231 - 244 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Graph Layout].

  • Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond: Fixed-Parameter Algorithms for Kemeny Scores . In: AAIM 2008. 2008, p. 60 - 71 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Social Choice, Election, Voting Theory].

  • Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier: Algorithms and Hardness Results for Some Graph Motif Problems. In: CPM 2008. 2008, p. 31 - 43 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Computational Biology, Phylogenetic Trees].

  • Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin: On Problems without Polynomial Kernels. In: ICALP(1)2008. 2008, p. 563 - 574 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Applications to Preprocessing, Data Reduction].

  • Michael Ralph Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh: Graph Layout Problems Parameterized by Vertex Cover. In: ISAAC2008. 2008, p. 294 - 305 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Graph Layout, Geometry ].

  • Michael Ralph Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle: Leaf Powers and Their Properties: Using the Trees. In: ISAAC2008. 2008, p. 402 - 413 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Applications in reconstruction of the evolutionary history of species.].

  • Michael Ralph Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond: A Purely Democratic Characterization of W[1]. In: IWPEC 2008. 2008, p. 103 - 114 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Satisfiability, Networks ].

  • Michael Ralph Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides: Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. In: Algorithmica. 52(2), 2008, p. 167 - 176 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Packing Problems, Matching Problems.].

  • Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood: On the Parameterized Complexity of Layered Graph Drawing. In: Algorithmica. 52(2), 2008, p. 267 - 292 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Graph Drawing, Geometry].

  • Michael Ralph Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh: Parameterized Low-distortion Embeddings - Graph metrics into lines and trees. In: CoRR abs/0804.3028: (2008). 2008, p. 1 - 14 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Graph Metrics, Graph Distortion, Graph Embeddings.].

  • Michael Ralph Fellows, Rodney G. Downey, Michael A. Langston: The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors. In: The Computer Journal. 51(1), 2008, p. 1 - 6 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Vision of the future of theoretical computer science. ].

  • Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond: : Parameterized approximation of dominating set problems. In: Information Processing Letters. 109(1), 2008, p. 68 - 70 [Parameterized Complexity, Theoretical Computer Science, Algorithm Design, Approximation, Dominating Set Problems, Applications to Scheduling].

Ferhatosmanoglu, Prof. Dr. Hakan

Bilkent University, United Kingdom
Field of research: Computer and information science
Host: Prof. Dr. Krishna Gummadi Max-Planck-Institut für Softwaresysteme
  • J. Asia Biega, Azin Ghazimatin, Hakan Ferhatosmanoglu, Krishna P. Gummadi, Gerhard Weikum: Learning to un-rank: Quantifying search exposure for users in online communities. In: Proceedings of the 26th ACM International Conference on Information and Knowledge Management (CIKM). 2017, p. 1 - 10 [Privacy, Search Exposure, Ranking Exposure, Information Retrieval, Reverse Nearest Neighbors, Learning to Rank, Text Mining].

  • Emre Yilmaz, Sanem Elbasi, Hakan Ferhatosmanoglu: Predicting Optimal Facility Location without Customer Locations. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD). 2017, p. 2121 - 2130 [Location Analytics; Optimal Location Queries; Uncertainty; Prediction; Facility Location; Synthetic Data; Data Generation.].

  • Sreyasi Nag Chowdhury, Niket Tandon, Hakan Ferhatosmanoglu, Gerhard Weikum: VISIR: Visual and Semantic Image Label Refinement. In: ACM WSDM. 2018, p. 117 - 125 [image label, visual, semantic coherence, commonsense knowledge base, tagging, object detection].

Grigoriev, Prof. Dr. Dima

Universite de Lille I, France
Field of research: Theoretical computer and information science
Host: Prof. Dr. Ulrich Trottenberg Fraunhofer-Institut für Algorithmen und Wissenschaftliches Rechnen (SCAI)
  • Dima Grigoriev Fritz Schwarz: Loewy decomposition of linear third-order PDE's in the plane. In: Proc. ACM Int. Symp. Symb. Algebr. Comput., Austria. 2008, p. 277 - 286 [PDE].

  • Dima Grigoriev: Newton-Puiseux series for non-holonomic D-modules and factoring linear partial differential operators. In: Moscow Mathematical Journal. 9, 2009, p. 775 - 800.

  • Dima Grigoriev Vladimir Shpilrain: Authentication from matrix conjugation. In: Groups, Complexity, Cryptology. 1, 2009, p. 199 - 205.

  • Dima Grigoriev, Sergei Vakulenko: Instability, Complexity and evolution. In: Journal of Mathematical Sciences . 158, 2009, p. 787 - 808.

  • Dima Grigoriev, Fritz Schwarz: Non-holonomic ideals in the plane and absolute factoring. In: Proc. ACM Int. Symp. Symb. Algebr. Comput., Munich,. Proc., 2010, p. 93 - 97.

  • Dima Grigoriev, Gerald Tenenbaum: A low complexity probabilistic test for integer multiplication. In: Journal of Complexity. 26, 2010, p. 263 - 267.

  • Dima Grigoriev, E. Bierstone, P. Milman, J. Wlodarczyk: Effective Hironaka resolution and its complexity. In: The Asian Journal of Mathematics, volume dedicated to H. Hironaka. 15, 2011, p. 193 - 228.

  • Dima Grigoriev, S.Vakulenko: Complexity and stable evolution of circuits. In: Proofs, Categories and Computations. Essays in honor of Grigori Mints.. (Ed. Edited by Solomon Feferman and Wilfried Sieg. ) Tributes Series. Dov Gabbay: College Publications. , 2010, p. 279 - 296.

  • D.Grigoriev, J. Reinitz, S. Vakulenko, A. Weber : Punctuated evolution and robustness in morphogenesis. In: BioSystems. 123, 2014, p. 106 - 113 [BioSystems, evolution, complexity, computer].

Hemaspaandra, Prof. Dr. Lane A.

University of Rochester, United States of America
Field of research: Theoretical computer and information science
Host: Prof. Dr. Jörg-Matthias Rothe Heinrich-Heine-Universität Düsseldorf
  • Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe: The Shield that Never Was: Societies with Single-Peaked Preferences Are More Open to Manipulation and Control. In: Information and Computation. 209, 2011, p. 89 - 107 [Computational complexity, computational social choice].

  • Gabor Erdelyi, Lane A. Hemaspaandra, Joerg Rothe, Holger Spakowski: Generalized Juntas and NP-Hard Sets. In: Theoretical Computer Science. 410, 2009, p. 3995 - 4000 [Computational complexity, computational social choice ].

  • Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. In: Mathematical Logic Quarterly. 55, 2009, p. 397 - 424 [Computational complexity, computational social choice ].

  • Gabor Erdelyi, Lane A. Hemaspaandra, Joerg Rothe, Holger Spakowski: Frequency of Correctness versus Average Polynomial Time. In: Information Processing Letters. 109, 2009, p. 946 - 949 [Computational complexity, computational social choice].

  • Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe : Llull and Copeland Voting Computationally Resist Bribery and Control. In: Journal of Artificial Intelligence Research. 35, 2009, p. 275 - 341 [Computational complexity, computational social choice ].

  • Lane A. Hemaspaandra, Joerg Rothe, Amitabh Saxena: Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for Worst-Case One-Way Functions. In: Theoretical Computer Science. 401, 2008, p. 27 - 35 [Computational complexity].

  • Dorthea Baumeister, Gabor Erdelyi, Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe: Computational Aspects of Approval Voting. In: Handbook on Approval Voting. (Ed. J. Laslier, M. Sanver) Springer, 2010, p. 199 - 251 [Computational complexity, computational social choice ].

Lee, Prof. Dr. Der-Tsai

Academia Sinica, Republic of China (Taiwan)
Field of research: Computer and information science
Host: Prof. Dr. Dorothea Wagner Karlsruher Institut für Technologie (KIT)
  • Der-Tsai Lee, Franz Aurenhammer, Rolf Klein: Voronoi Diagrams and Delaunay Triangulations. World Scientific Publishing Co. Pte. Ltd., 2013, 337 pp.

Shukla, Prof. Dr. Sandeep Kumar

Virginia Polytechnic Institute and State University, United States of America
Field of research: Computer engineering, technical computer science
Host: Prof. Dr. Klaus Schneider Technische Universität Kaiserslautern
  • Jens Brandt, Mike Gemünde, Klaus Schneider, Sandeep K. Shukla and Jean-Pierre Talpin : Representation of synchronous, asynchronous, and polychronous components by clocked guarded actions. In: Springer Journal on Design Automation for Embedded Systems. 2012, p. 1 - 35 [Synchronous Programming, Embedded Systems, Embedded Software, Formal Methods, Polychronous Systems, SIGNAL, Quartz, Programming Semantics, Program Synthesis].

  • Brandt, J.; Schneider, K.; Ahuja, S.; Shukla, S.K.; : The Model Checking View to Clock Gating and Operand Isolation. In: Proceedings of the 10th International Conference on Application of Concurrency to System Design (ACSD), 2010 . Braga, Portugal: IEEE Computer Society, 2010, p. 181 - 190 [Low Power VLSI Design, Clock Gating, Operand Isolation, Model Checking, Mu-Calculus,].

  • Jens Brandt, Klaus Schneider, and Sandeep K. Shukla: Translating concurrent action oriented specifications to synchronous guarded actions. In: ACM SIGPLAN Notices. 45, 2010, p. 47 - 56 [Guarded Command Languages, CAOS, Bluespec, Synchronous Programming].

  • Brandt, J.; Gemunde, M.; Schneider, K.; Shukla, S.K.; Talpin, J.: Integrating system descriptions by clocked guarded actions. In: Proceedings of the Forum on Specification and Design Languages (FDL), 2011 . Germany: IEEE Xplore, 2011, p. 1 - 8 [Synchronous Languages, Polychronous Languages, System Synthesis, Quartz, SIGNAL, Guarded Command Languages].