Skip to main content

Research Repository

Advanced Search

All Outputs (12)

Empirical Software Engineering (2014)
Book Chapter
Budgen, D., & Kitchenham, B. (2014). Empirical Software Engineering. In T. Gonzalez, J. Diaz-Herrera, & A. Tucker (Eds.), Computing Handbook (78-1 - 78-13). (3rd). CRC Press

Intersection Graphs of L-Shapes and Segments in the Plane (2014)
Book Chapter
Felsner, S., Knauer, K., Mertzios, G., & Ueckerdt, T. (2014). Intersection Graphs of L-Shapes and Segments in the Plane. In E. Csuhaj-Varjú, M. Dietzfelbinger, & Z. Ésik (Eds.), Mathematical foundations of computer science 2014 : 39th international symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, part II (299-310). Springer Verlag. https://doi.org/10.1007/978-3-662-44465-8_26

An L-shape is the union of a horizontal and a vertical segment with a common endpoint. These come in four rotations: ⌊,⌈,⌋ and ⌉. A k-bend path is a simple path in the plane, whose direction changes k times from horizontal to vertical. If a graph adm... Read More about Intersection Graphs of L-Shapes and Segments in the Plane.

Determining Majority in Networks with Local Interactions and Very Small Local Memory (2014)
Book Chapter
Mertzios, G., Nikoletseas, S., Raptopoulos, C., & Spirakis, P. (2014). Determining Majority in Networks with Local Interactions and Very Small Local Memory. In J. Esparza, P. Fraigniaud, T. Husfeldt, & E. Koutsoupias (Eds.), Automata, languages, and programming : 41st international colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, proceedings, part I (871-882). Springer Verlag. https://doi.org/10.1007/978-3-662-43948-7_72

We study here the problem of determining the majority type in an arbitrary connected network, each vertex of which has initially two possible types (states). The vertices may have a few additional possible states and can interact in pairs only if the... Read More about Determining Majority in Networks with Local Interactions and Very Small Local Memory.

Minimum Bisection Is NP-hard on Unit Disk Graphs (2014)
Book Chapter
Díaz, J., & Mertzios, G. (2014). Minimum Bisection Is NP-hard on Unit Disk Graphs. In E. Csuhaj-Varjú, M. Dietzfelbinger, & Z. Ésik (Eds.), Mathematical foundations of computer science 2014 : 39th international symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, part II (251-262). Springer Verlag. https://doi.org/10.1007/978-3-662-44465-8_22

In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus solving a longstanding open question.

PaTriG – Particle Transport Simulation in Grids (2014)
Book Chapter
Weinzierl, T., Neumann, P., Unterweger, K., Verleye, B., & Wittmann, R. (2014). PaTriG – Particle Transport Simulation in Grids. In S. Wagner, A. Bode, H. Satzger, & M. Brehm (Eds.), High Performance Computing in Science and Engineering 2014 (128-129). Bayerische Akademie der Wissenschaften

Towards a Characterization of Constant-Factor Approximable Min CSPs (2014)
Book Chapter
Dalmau, V., Krokhin, A., & Manokaran, R. (2015). Towards a Characterization of Constant-Factor Approximable Min CSPs. In P. Indyk (Ed.), Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms : San Diego, California, USA, January 4-6, 2015 (847-857). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973730.58

We study the approximability of Minimum Constraint Satisfaction Problems (Min CSPs) with a fixed finite constraint language Γ on an arbitrary finite domain. The goal in such a problem is to minimize the number of unsatisfied constraints in a given in... Read More about Towards a Characterization of Constant-Factor Approximable Min CSPs.

Approximating Fixation Probabilities in the Generalized Moran Process (2014)
Book Chapter
Mertzios, G. (2014). Approximating Fixation Probabilities in the Generalized Moran Process. In M. Kao (Ed.), Encyclopedia of algorithms (1-6). Springer Verlag. https://doi.org/10.1007/978-3-642-27848-8_596-1

Problem Definition Population and evolutionary dynamics have been extensively studied, usually with the assumption that the evolving population has no spatial structure. One of the main models in this area is the Moran process [17]. The initial popul... Read More about Approximating Fixation Probabilities in the Generalized Moran Process.

Multifaceted open social learner modelling (2014)
Book Chapter
Shi, L., Cristea, A., & Hadzidedic, S. (2014). Multifaceted open social learner modelling. In P. Elvira, R. W. Lau, K. Pata, H. Leung, & L. Mart (Eds.), Advances in Web-Based Learning – ICWL 2014, 13th International Conference, Tallinn, Estonia, August 14-17, 2014, Proceedings (32-42). Springer Verlag. https://doi.org/10.1007/978-3-319-09635-3_4

Open social learner modelling (OSLM) approaches are promoted in order to assist learners in self-directed and self-determined learning in a social context. Still, most approaches only focus on visualising learners’ performance, or providing complex t... Read More about Multifaceted open social learner modelling.

Robust and Efficient Large-Large Table Outer Joins on Distributed Infrastructures (2014)
Book Chapter
Cheng, L., Kotoulas, S., Ward, T., & Theodoropoulos, G. (2014). Robust and Efficient Large-Large Table Outer Joins on Distributed Infrastructures. In F. Silva, I. Dutra, & V. S. Costa (Eds.), Euro-Par 2014 Parallel Processing : 20th International Conference, Porto, Portugal, August 25-29, 2014 ; proceedings (258-269). Springer Verlag. https://doi.org/10.1007/978-3-319-09873-9_22

Outer joins are ubiquitous in many workloads but are sensitive to load-balancing problems. Current approaches mitigate such problems caused by data skew by using (partial) replication. However, contemporary replication-based approaches (1) introduce... Read More about Robust and Efficient Large-Large Table Outer Joins on Distributed Infrastructures.