yusuke1997/dblp-id-title huggingface dataset:
Mensch-Technik-Interaktion: intuitiv, erwartungskonform oder vertraut?
e-motion - über elektronische Formen der Bewegung und die Gestaltung von Interaktionssystemen
Empirische Realität versus subjektive Repräsentation: Einfluss von Persönlichkeitsmerkmalen auf die Prozessüberwachung und -führung in Mensch-Maschine-Systemen
Vermittlung und Erhebung von mentalen Kausalmodellen komplexer dynamischer Systeme
Blickbewegungsanalyse zur Bewertung piktographischer Visualisierungen
Editorial: User Experience - Recent approaches to intuitive use and hedonic aspects in human-technology interaction
Editorial zum Themenheft Modellierung und Simulation in Mensch-Maschine-Systemen
Kausalität - Die Wahrnehmung von Ursache und Wirkung
Detection and Processing of Visual Information in Three-Dimensional Space
Die Beurteilung der Informationsdarstellung auf Airport Moving Maps nach DIN EN ISO 9241-12
Usability Evaluation of User Interfaces with the Computer-aided Evaluation Tool PRO-KUS
Animation and Continuity: Prerequisites for Intuitive Interaction
Simulation des Menschen als Entscheider in der netzbasierten Operationsführung
Passive und Aktive Sicherheitsmaßnahmen im Kraftfahrzeug
Multitasking-Strategien in der Mensch-Maschine-Interaktion
Teamarbeit am Digitalen Lagetisch mit Fovea-Tablett®
Towards a unified view of intuitive interaction: definitions, models and tools across the world
Symbolic Aspects of University Homepage Design: What Appeals to Different Cultures?
Gestaltung einer verhaltenswirksamen Müdigkeitsrückmeldung im Kraftfahrzeug
Was bedient der Fahrer? Feldversuche zu Erfassung der Fahrer-Fahrzeug-Interaktion
Potenzial der Anwendung von VR-Interaktionstechniken im Usability-Testing
Editorial zur Ausgabe Aufmerksamkeit und Situation Awareness beim Autofahren
Untersuchung von Designpräferenzen mit Hilfe von Skalierungsmethoden
Entwicklung und Überprüfung einer Checkliste zur Bewertung von Software für Kinder
Modellierung und Simulation menschlichen Verhaltens als Methode der Mensch-Maschine-System-Forschung
Kognitive Modellierung in dynamischen Mensch-Maschine-Systemen
Entwicklung und Evaluierung einer bordseitigen Benutzungsoberfläche für Data-Link-Kommunikation zwischen Piloten und Fluglotsen
Serviceteil Modellierung und Simulation für Mensch-Maschine-Systeme
Arbeitskreis Blickbewegung: Chancen und Schwächen der Blickanalyse bei der Bewertung von Objekten
Editorial: Augen- und Blickbewegungsregistrierung in der Mensch-Maschine-Interaktion
Antizipative Modellierung des Benutzerverhaltens mit Hilfe von Aktionsvorhersage-Algorithmen
Buchrezension: Resilience Engineering
Conflict Resolution in En Route Traffic - A Draft Concept for an Assistance System Compatible with Solutions of Air Traffic Controllers
The Diversity of Non-instrumental Qualities in Human-Technology Interaction
Learning of Sensorimotor Contingencies to move a Four-Legged Robot
Nutzen, Möglichkeiten und Grenzen von Interaktion in Edutainment-Programmen
Opportunities and Challenges of Modeling User Behavior in Complex Real World Tasks
Kurzfassungen
Blickbewegungsmessung als Indikator für Zeitempfinden bei der Steuerung einer prozesstechnischen Simulation - Eine explorative Studie
Trends and Developments from the VR2007 Conference
Automatic object identification and analysis of eye movement recordings
Interview with Gitte Lindgaard on visual appeal and aesthetics in human-technology interaction
Why should we use Eye Tracking for Hypertext Design?
Editorial 6. Berliner Werkstatt
Towards Networked and Structured VR ERA: Intuition Network of Excellence and Future Research Challenges
IUUI - Intuitive Use of User Interfaces: Auf dem Weg zu einer wissenschaftlichen Basis für das Schlagwort 'Intuitivität'
Editorial: Die Planung zur Weiterentwicklung von MMI-interaktiv
Extending ACT-R for modeling dynamics and timing for operat-ing human-machine systems
Überprüfung der Bedienbarkeit von elektronischen Geräten am Beispiel von Zeitschaltuhren
Auswirkungen von Multi-Sektor-Planung auf die Lotsen der Streckenflugkontrolle
Choosing and getting started with a cognitive architecture to test and use human-machine
Establishing a semantic differential on product prototype aesthetics: a research approach
Empfehlungen für die Bestimmung der Spurhaltegüte im Kontext der Fahrsimulation
Benutzerzentrierte Gestaltung eines mobilen Service- und Wartungssystems unter Verwendung von AR-Technologie
Mensch-Maschine-Interaktion im Jahr 2010: eine Vision
Maus-O-Meter: Ein Werkzeug zur Aufzeichnung von Interaktion in Websites
Bewertung der Benutzbarkeit einer Beratungssoftware für das Kleben
Service: Abstractband der 7. Berliner Werkstatt Mensch-Maschine-Systeme
Situation Awareness beim Autofahren als Verstehensprozess
Learning Human Behavior from Analyzing Activities in Virtual Environments
Pointing Devices for Navigation in WINDOWS-based Machine-Controllers
Eye tracking and its application in usability and media research
Jugendschutz am Wendepunkt
Ansätze zur kognitiven Simulation eines Autofahrers
Fehleinschätzung von Zeit als Ursache für Ablenkungseffekte beim Fahren: Bedeutung von Menüstruktur und visuellen Anforderungen
Neue Impulse für die technische Berufsbildung durch aktive Multimedia-Nutzung
Global Demands of non-european Markets for the Design of User-Interfaces
Editorial zur Werkstätten für Mensch-Maschine-Interaktion
Untersuchung des Fußgänger-Fahrzeug Unfalls hinsichtlich des Fahrerverhaltens
Akteursbasierte Simulation in Virtuellen Welten
Little Dictionary of Eye Movement Parameters
Non-intrusive Eye and Gaze Tracking for Natural Human Computer Interaction
Richtlinien für die Gestaltung von Software für Kinder im Vorschulalter
Editorial: Human-Machine Interaction in Virtual Environments
Konzept für automatische Auswertung von Blickbewegungen bei dynamischen Informationen
Mensch-Maschine-Schnittstelle für Vernetztes Fahren: Regeln zur Systemgestaltung
ErgoCheck - ein Tool zur Unterstützung der Entwicklung und Evaluation der nutzergerechten Gestaltung von Bediensystemen bei Maschinen
Comparison of methods for studying air traffic controller's information strategies
Digital Human Modeling for Design and Evaluation of Human-Machine Systems
Kids' Space
Die Gesetze der Einfachheit. Eine Buchbesprechung von John Maedas Laws of Simplicity
Empirical investigations into intuitive interaction: a summary
Data reduction and exact algorithms for clique cover
The Influence of Caches on the Performance of Heaps
Increased bit-parallelism for approximate and multiple string matching
A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation
An experimental study of point location in planar arrangements in CGAL
Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies
An Experimental Study of Algorithms for Online Bipartite Matching
Recent Advances in Fully Dynamic Graph Algorithms - A Quick Reference Guide
How much geometry it takes to reconstruct a 2-manifold in R 3
Limited discrepancy search revisited
Matrix Multiplication: A Case Study of Enhanced Data Cache Utilization
Solving Graph Problems via Potential Maximal Cliques: An Experimental Evaluation of the Bouchitté-Todinca Algorithm
Engineering Practical Lempel-Ziv Tries
A graph approach to the threshold all-against-all substring matching problem
Satisfiability by Maxwell-Boltzmann and Bose-Einstein Statistical Distributions
An Experimental Study of Dynamic Algorithms for Transitive Closure
A blocked all-pairs shortest-paths algorithm
Irredundant Intervals
Exact pattern matching with feed-forward bloom filters
GRASP with path relinking for the weighted MAXSAT problem
Lock Bypassing: An Efficient Algorithm for Concurrently Accessing Priority Heaps
Optimal selection and sorting via dynamic programming
A Data-dependent Approach for High-dimensional (Robust) Wasserstein Alignment
Predicting String Search Speed
Finding large stable matchings
SimBa: An Efficient Tool for Approximating Rips-filtration Persistence via Simplicial Batch Collapse
Toward an Understanding of Long-tailed Runtimes of SLS Algorithms
A backtracking-based algorithm for hypertree decomposition
An Experimental Study of the Basis for Graph Drawing Algorithms
Reduction rules deliver efficient FPT-algorithms for covering points with lines
Xor Filters
Stable matching with couples: An empirical study
Terracost: Computing least-cost-path surfaces for massive grid terrains
Computing Coordinated Motion Plans for Robot Swarms: The CG: SHOP Challenge 2021
Data structures resilient to memory faults: An experimental study of dictionaries
Multilevel local search algorithms for modularity clustering
A Memetic Algorithm to Schedule Planned Maintenance for the National Grid
Geometric Heuristics for Rectilinear Crossing Minimization
Algorithms for dynamic multicast key distribution
Partitioning planar graphs with costs and weights
Upward Planarity Testing in Practice: SAT Formulations and Comparative Study
Dynamic graph clustering combining modularity and smoothness
Triangle-Based Heuristics for Area Optimal Polygonizations
2-Opt Moves and Flips for Area-optimal Polygonizations
Generating constrained random graphs using multiple edge switches
Fast k -selection algorithms for graphics processing units
Exact online two-dimensional pattern matching using multiple pattern matching algorithms
sgen1: A generator of small but difficult satisfiability benchmarks
JEA Special Section
Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions
Rectangle covers revisited computationally
Multiword atomic read/write registers on multiprocessor systems
Incremental Updates of Generalized Hypertree Decompositions
SAT-boosted Tabu Search for Coloring Massive Graphs
Complexity of Coloring Random Graphs: An Experimental Study of the Hardest Region
Improving Memory Performance of Sorting Algorithms
Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis
Comparing integer data structures for 32- and 64-bit keys
A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques
Comparing Two Clusterings Using Matchings between Clusters of Clusters
Engineering burstsort: Toward fast in-place string sorting
An Empirical Study of Dynamic Graph Algorithms
An experimental study of different approaches to solve the market equilibrium problem
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring
Obtaining optimal k -cardinality trees fast
Quasirandom rumor spreading: An experimental analysis
Computing Autotopism Groups of Partial Latin Rectangles
Greedy Matching Algorithms: An Experimental Study
Multipattern string matching with q -grams
Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough?
Fast and Flexible String Matching by Combining Bit-Parallelism and Suffix Automata
Finding the Chromatic Number by Means of Critical Graphs
Exact solutions and bounds for general art gallery problems
An Exact Method for the Minimum Feedback Arc Set Problem
Succinct backward-DAWG-matching
Editorial, SEA 2014 Special Issue
Experiments With List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism
Computing elevation maxima by searching the gauss sphere
Efficient Matching for Column Intersection Graphs
Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structures
Property Suffix Array with Applications in Indexing Weighted Sequences
New heuristic and interactive approaches to 2D rectangular strip packing
A general buffer scheme for the windows scheduling problem
Multilevel algorithms for linear ordering problems
Multi-level Steiner Trees
A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem
A heuristic for bottleneck crossing minimization and its performance on general crossing minimization: Hypothesis and experimental study
Anatree: A Fast Data Structure for Anagrams
Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization
A performance study of data layout techniques for improving data locality in refinement-based pathfinding
ACM journal on experimental algorithmics special issue on multicore algorithms
Caching and Scheduling for Broadcast Disk Systems
Minimum time-dependent travel times with contraction hierarchies
Experimental Analysis of Dynamic Algorithms for the Single-Source Shortest-Path Problem
StreamKM++: A clustering algorithm for data streams
Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks
Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) Comparisons
On Computing the Gromov Hyperbolicity
Integrating coordinated checkpointing and recovery mechanisms into DSM synchronization barriers
Algorithms for Efficiently Computing Structural Anonymity in Complex Networks
A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique
An experimental evaluation of the scalability of real-time scheduling algorithms on large-scale multicore platforms
Practical Wavelet Tree Construction
Power Balance and Apportionment Algorithms for the United States Congress
A Sequential Importance Sampling Algorithm for Counting Linear Extensions
Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity
Grid sifting: Leveling and crossing reduction
Using random sampling to build approximate tries for efficient string sorting
Updating Dynamic Random Hyperbolic Graphs in Sublinear Time
Reverse-Safe Text Indexing
Weight-Biased Leftist Trees and Modified Skip Lists
Partitioning graphs to speedup Dijkstra's algorithm
On a Model of Virtual Address Translation
SSLC: A Search Algorithm Based on Linear Collisions and Poisson Probability Distribution
Computing visibility on terrains in external memory
Removing Cycles for Minimizing Crossings
An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets
Degree Reduction in Labeled Graph Retrieval
Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022
A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis
Fully Dynamic 2-Hop Cover Labeling
Fully Dynamic Graph Algorithms Inspired by Distributed Computing: Deterministic Maximal Matching and Edge Coloring in Sublinear Update-Time
Four-dimensional hilbert curves for R-trees
Practical Algorithms for Finding Extremal Sets
Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies
Adaptive data structures for IP lookups
Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness Centrality
Engineering multilevel overlay graphs for shortest-path queries
On Symmetric Rectilinear Partitioning
Heuristics for estimating contact area of supports in layered manufacturing
A Faster Hafnian Formula for Complex Matrices and Its Benchmarking on a Supercomputer
Engineering highway hierarchies
Grammar Compression by Induced Suffix Sorting
Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness
Better external memory suffix array construction
Editorial - ESA 2016 Special Issue
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments
Analysis of a High-Performance TSP Solver on the GPU
Parallel Five-cycle Counting Algorithms
General Document Retrieval in Compact Space
Rapid Software Prototyping in Molecular Modeling Using the Biochemical Algorithms Library (BALL)
Speeding up spatial approximation search in metric spaces
Listing All Maximal k -Plexes in Temporal Graphs
An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms
Algorithms for pure Nash equilibria in weighted congestion games
Weakening Cardinality Constraints Creates Harder Satisfiability Benchmarks
Fast prefix matching of bounded strings
Reactive Search, a History-Sensitive Heuristic for MAX-SAT
Summarizing spatial data streams using ClusterHulls
Cache-conscious sorting of large sets of strings with dynamic tries
An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization
Practical Parallel Algorithms for Personalized Communication and Integer Sorting
ILP-Based Local Search for Graph Partitioning
Introduction to Special Issue ALENEX 2013
Quantum Annealing versus Digital Computing: An Experimental Comparison
Engineering a cache-oblivious sorting algorithm
Correspondence-Based Data Structures for Double-Ended Priority Queues
Implementing the LZ-index: Theory versus practice
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Efficiently implementing maximum independent set algorithms on circle graphs
I/O-efficient point location using persistent B-trees
Inversion-sensitive sorting algorithms in practice
Upgrading Subgroup Triple-Product-Property Triples
Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition
A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem
Clique Counting in MapReduce: Algorithms and Experiments
Fast computation of empirically tight bounds for the diameter of massive graphs
Area Optimal Polygonization Using Simulated Annealing
Cache-efficient string sorting using copying
Faster Compressed Suffix Trees for Repetitive Collections
Implementing minimum cycle basis algorithms
Dynamic spatial approximation trees
Strong Steiner Tree Approximations in Practice
Ranking tournaments: Local search and a new algorithm
A Practical Algorithm for Volume Estimation based on Billiard Trajectories and Simulated Annealing
An SDP approach to multi-level crossing minimization
Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth
Experimental average-case performance evaluation of online algorithms for routing and wavelength assignment and throughput maximization in WDM optical networks
On branching rules for convex mixed-integer nonlinear optimization
Relational Concept Learning by Cooperative Evolution
A domain decomposition algorithm for constraint satisfaction
Greedy and Local Search Heuristics to Build Area-Optimal Polygons
Goal-directed shortest-path queries using precomputed cluster distances
Computing the nxm Shortest Paths Efficiently
The Exponential Hash Function
Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation
Routing in Multimodal Transportation Networks with Non-scheduled Lines
Efficient relaxed search in hierarchically clustered sequence datasets
Approximation algorithms for speeding up dynamic programming and denoising aCGH data
The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression
Augment or Push: A Computational Study of Bipartite Matching and Unit-Capacity Flow Algorithms
The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation
Generating Difficult CNF Instances in Unexplored Constrainedness Regions
Buffered Streaming Graph Partitioning
psort , yet another fast stable sorting software
Tight Localizations of Feedback Sets
Engineering planar separator algorithms
Lazy Lempel-Ziv Factorization Algorithms
Discrete range searching primitive for the GPU and its applications
Engineering a compressed suffix tree implementation
An improved heuristic for computing short integral cycle bases
Computation in multicriteria matroid optimization
Practical Compact Indexes for Top- k Document Retrieval
A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching
ReHub: Extending Hub Labels for Reverse k -Nearest Neighbor Queries on Large-Scale Networks
A dynamic topological sort algorithm for directed acyclic graphs
Introduction to special issue ALENEX'11
Design and Implementation of Move-Based Heuristics for VLSI Hypergraph Partitioning
An experimental study of algorithms for fully dynamic transitive closure
Finding the k Shortest Simple Paths: Time and Space Trade-offs
Algorithmic Aspects in Speech Recognition: An Introduction
Random Projections for Linear Programming: An Improved Retrieval Phase
Coordinated Path Planning through Local Search and Simulated Annealing
Fingerprinting-based Minimal Perfect Hashing Revisited
An experimental study of sorting and branch prediction
I/O-Efficient Algorithms for Problems on Grid-Based Terrains
Experiments on exact crossing minimization using column generation
A framework for probabilistic numerical evaluation of sensor networks: A case study of a localization protocol
Improving the Betweenness Centrality of a Node by Adding Links
An experimental comparison of single-sided preference matching algorithms
Geometric algorithms for optimal airspace design and air traffic controller workload balancing
Graph Bisection with Pareto Optimization
Dynamic trees in practice
Constructing a High-Dimensional k NN-Graph Using a Z-Order Curve
An Experimental Study on Approximating k Shortest Simple Paths
New Exact and Heuristic Algorithms for Graph Automorphism Group and Graph Isomorphism
Cache-Friendly implementations of transitive closure
Implementing approximation algorithms for the single-source unsplittable flow problem
Faster reaction mapping through improved naming techniques
User-Constrained Multimodal Route Planning
Cache-, hash-, and space-efficient bloom filters
Area-Optimal Simple Polygonalizations: The CG Challenge 2019
Coordinated Motion Planning Through Randomized k -Opt
Introduction to the Special Issue SEA 2018
SHARC: Fast and robust unidirectional routing
High-Quality Hypergraph Partitioning
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
Faster placement of hydrogens in protein structures by dynamic programming
The "real" approximation factor of the MST heuristic for the minimum energy broadcasting
Dynamic Path-decomposed Tries
Experimental study of geometric t -spanners
Numerical Algorithm for Pólya Enumeration Theorem
Computing an approximation of the 1-center problem on weighted terrain surfaces
Cache Oblivious Algorithms for Computing the Triplet Distance between Trees
Compressed text indexes: From theory to practice
Indexing methods for approximate dictionary searching: Comparative analysis
On the adaptiveness of Quicksort
The Model Counting Competition 2020
Greedy heuristics for the bounded diameter minimum spanning tree problem
Geometric containers for efficient shortest-path computation
Shadoks Approach to Low-Makespan Coordinated Motion Planning
Comments on "An Exact Method for the Minimum Feedback Arc Set Problem"
Evaluating and Tuning n -fold Integer Programming
Sum-of-squares heuristics for bin packing and memory allocation
Lists revisited: Cache-conscious STL lists
Combining speed-up techniques for shortest-path computations
Shortest-path feasibility algorithms: An experimental evaluation
Heuristics on Lattice Basis Reduction in Practice
Algorithms and Data Structures for Hyperedge Queries
Improving the performance of multidimensional search using fingers
Efficient models for timetable information in public transportation systems
Twol-amalgamated priority queues
Editorial: ALENEX 2017 Special Issue
An Updated Experimental Evaluation of Graph Bipartization Methods
A Constructive Heuristic for the Uniform Capacitated Vertex k -center Problem
Bounded-Degree Plane Geometric Spanners in Practice
An efficient, versatile approach to suffix sorting
Adapting Radix Sort to the Memory Hierarchy
Route planning with flexible edge restrictions
Algorithms for longer OLED lifetime
Introduction to Special Issue ALENEX'12
An Audit Tool for Genome Rearrangement Algorithms
Approximating the true evolutionary distance between two genomes
Optimal Area Polygonization by Triangulation and Visibility Search
Papers from ALENEX 2005
A dictionary implementation based on dynamic perfect hashing
Assignment-minimum clique coverings
Alternative routes in road networks
Locally Compressed Suffix Arrays
Solving maximum flow problems on real-world bipartite graphs
Fast Exact Computation of Isocontours in Road Networks
Analytical and experimental comparison of six algorithms for the vertex cover problem
Practical approaches to reduce the space requirement of lempel-ziv-based compressed text indices