yusuke1997/dblp-id-title huggingface dataset:
Statistical study of the H.266/VVC Low-Frequency Non-Separable Transform
LC-VCO with 1.6 GHz Tuning Range and Switched Cross-Coupled Core for Power Optimizing
Fusion with EEG signals and Images for closed or open eyes detection using deep learning
Design and Characterization of an Integrated Multi-Sensor Device for Air Quality Monitoring
Simulation of waveguide port position and boundary conditions of the double rectangle metamaterial shape
Combining Acceleration and Approximation in Dependable Edge AI: Optimization Methodology and Tools Applied to a Case Study
Producing a Bidirectional ATPG Compliant Verilog-HDL Memory Model of SRAM
Evaluation of Human Body Communications Pathloss using Capacitive Coupling
STM32 miner : A lightweight blockchain mining system
Quantization effect on MRF performance for VVC encoder
Fault Tolerant Design for Memristor-based AI Accelerators
2023 IEEE International Conference on Design, Test and Technology of Integrated Systems, DTTIS 2023, Gammarth, Tunisia, November 1-4, 2023
Optimization of senseFET for current sensing in Low Voltage power integrated systems
Benchmarking and Validation of Sub-mW 30GHz VG-LNAs in 22nm FDSOI CMOS for 5G/6G Phased-Array Receivers
OpenTRNG: an open-source initiative for ring-oscillator based TRNGs
LiFi-CFI: Light-weight Fine-grained Hardware CFI Protection for RISC-V
Notched gate MOSFET for capacitance reduction in RF SOI technology
Advanced Bone Fracture Detection Through Deep Learning with Radiological Imaging
AI Eye Charts: measuring the visual acuity of Neural Networks with test images
Power Consumption Reduction in Integrated Pacemakers: Design Strategies for Cortex-M0+ Processors
Multi-objective Optimisation of RISC-V CV32A6 for ML application
LC-VCO Design with Switched Varactor Array for L-Band in 65 nm CMOS Technology
MOSFET electron mobility enhancement using source/drain recess
Optimization of digital transistors for low-cost and low-power IoT applications in 40nm technology
High-Speed IO IP Process Technology & Design Interactions: Problems & Solutions
A Low Noise Amplifier for Medical Implant Communication System Band
Punch-through variability in buried channel transistors
Enhancing Performances of Intelligent EEG Signal Processing for Epilepsy Diagnosis
Discrete Wavelet Transform Coefficients for Drowsiness Detection from EEG Signals
Machine Learning-based feasibility estimation of digital blocks in BCD technology
Simulation Improvements, Challenges & Solutions While Using DTL, Signal Access & DebuggerDB Optimization, PC, TC, Save-Restore
Design Enhancement of Folded Beams Attachment for MEMS-Based Triaxial Accelerometer
HealthBeat traceability platform based on blockchain technology
Enhancing Automotive Embedded Applications: A Comprehensive Evaluation of Control Flow Checking Methods
Structure for characterization of MOS transistors in 28FD-SOI technology
Reliable and Efficient hardware for Trustworthy Deep Neural Networks
Static nonlinear errors compensation for RF front-end circuit on high speed RF sampling (Ti)ADCs
Lifecycle Management of RRAMs: Quality and Reliability
Cortex-M0+-based Pacemaker: CMOS Technologies Benchmark to Achieve Ultra-Low Power Operations
Detection and Estimation of Ethanol Concentration in a Disturbed Environment Utilizing Random Forest
Optimization and Experimentation of a 3-axis Piezoelectric Accelerometer with Cylindrical Proof Mass
Three-phase inverter without PWM for on-board actuator
Database Issues for Data Visualization, IEEE Visualization '95 Workshop, Atlanta, Georgia, USA, October 28, 1995, Proceedings
Database Requirements for Supporting End-User Visualizations
An Extended Schema Model for Scientific Data
Semantics and Mathematics of Scientific Data Sampling
Database Management for Data Visualization
Data Integration for Visualization Systems
FAN - An Array-Oriented Query Language
A System Architecture for Data-Oriented Visualization
Using Visualization to Support Data Mining of Large Existing Databases
LadMan: A Large Data Management System
Visualizing Reference Databases
database Issues for Data Visualization: IEEE Visualization '93 Workshop, San Jose, California, USA, October 26, 1993, Proceedings
Visualization Related Metadata
Collaborative Visualization Based on Distributed Data Objects
The VIS-AD Data Model: Integrating Metadata and Polymorphic Display with a Scientific Programming Language
Database Issues for Data Visualization: Supporting Interactive Database Explorartion
Database Issues for Data Visualization: Interaction, User Interfaces, and Presentation
Inherent Logical Structure of Computational Data: Its Role in Storage and Retrieval Strategies to Support User Queries
Metalevel Database Programming and Visualization with POETView
Data Mining and Data Visualization
A 3D Based User Interface for Information Retrieval Systems
Data Exploration Interactions and the ExBase System
Views, Visualization and Databases
Mathematical Structures of Data and Their Implications for Visualization
The Tioga-2 Database Visualization Environment
A Hyperspectral Image Data Exploration Workbench for Environmental Science Applications
Database Issues for Data Visualization: Scientific Data Modeling
Large Scale Data Analysis Using AVS5 and POSTGRES
Enhancing the Visual Clustering of Query-Dependent Database Visualization techniques Using Screen-Filling Curves
Design of a 3D User Interface to a Database
Requirements and Architecture of an Information Visualization Tool
Database Issues for Data Visualization: Developing a Data Model
Realtime Database Support for Environmental Visualization
Database Issues for Data Visualization: System Integration Issues
Toward imitating visual attention of experts in software development tasks
10th IEEE/ACM International Workshop on Eye Movements in Programming, EMIP@ICSE 2022, Pittsburgh, PA, USA, May 18-24, 2022
Eye tracking and program comprehension
Practical eye tracking with iTrace
Design of an executable specification language using eye tracking
Synchronized analysis of eye movement and EEG during program comprehension
Some Thoughts on Designing Eye Movement Studies for Novice Programmers
Attention in software maintenance: an eye tracking study
Proceedings of the 6th International Workshop on Eye Movements in Programming, EMIP@ICSE 2019, Montreal, Quebec, Canada, May 27, 2019
Visually analyzing students' gaze on C++ code snippets
Entropy of Eye Movements While Reading Code or Text
Eye-tracking analysis of source code reading on a line-by-line basis
The influence of different AOI models in source code comprehension analysis
Base Station Placement Problem on the Boundary of a Convex Region
A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs
Byzantine Gathering in Networks with Authenticated Whiteboards
Invitation to Combinatorial Reconfiguration
ℓ1-Embeddability of 2-Dimensional ℓ1-Rigid Periodic Graphs
On Compatible Matchings
Lower Bounds for Ramsey Numbers for Complete Bipartite and 3-Uniform Tripartite Subgraphs
WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings
Parameterized Algorithms for the Spanning Forest Isomorphism (or Containment) on Tree Problems
Combinatorial Optimization with Noisy Inputs: How Can We Separate the Wheat from the Chaff?
The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees
Online Exploration and Triangulation in Orthogonal Polygonal Regions
On the Computational Complexity of Monotone Constraint Satisfaction Problems
An Approximation Algorithm for Maximum Internal Spanning Tree
Farthest Voronoi Diagrams under Travel Time Metrics - (Extended Abstract)
Some Problems Related to the Space of Optimal Tree Reconciliations - (Invited Talk)
Vertex Domination in Dynamic Networks
Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers
Recognizing When a Preference System is Close to Admitting a Master List
Path Cover Problems with Length Cost
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
Computing the Center Region and Its Variants
Aspect Ratio Universal Rectangular Layouts
Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage
Alignment with Non-overlapping Inversions on Two Strings
Approximating Partially Bounded Degree Deletion on Directed Graphs
Packing Trees into 1-Planar Graphs
Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(nlogn) Area (Extended Abstract)
Alliances and Bisection Width for Planar Graphs
Finding Mode Using Equality Comparisons
Comparing and Aggregating Partial Orders with Kendall Tau Distances
Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components - (Extended Abstract)
A Simple Algorithm for r-gatherings on the Line
Popularity on the 3D-Euclidean Stable Roommates
The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
A New Transportation Problem on a Graph with Sending and Bringing-Back Operations
Forming Plurality at Minimum Cost
An Improvement of the Algorithm of Hertli for the Unique 3SAT Problem
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
Guarding Exterior Region of a Simple Polygon
On Generalized Planar Skyline and Convex Hull Range Queries
Computation of Non-dominated Points Using Compact Voronoi Diagrams
2-Colored Point-Set Embeddings of Partial 2-Trees
Proportionally Dense Subgraphs: Parameterized Hardness and Efficiently Solvable Cases
On Aligned Bar 1-Visibility Graphs
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration
Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs
Dispersion of Mobile Robots on Grids
Shared-Memory Parallel Frontier-Based Search
The Generalized Stable Allocation Problem
Pathwidth and Searching in Parameterized Threshold Graphs
Morphing Tree Drawings in a Small 3D Grid
Traversability, Reconfiguration, and Reachability in the Gadget Framework
WALCOM: Algorithms and Computation - 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024, Proceedings
Covering Points with Convex Sets of Minimum Size
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees
Calculating Average Joint Hamming Weight for Minimal Weight Conversion of d Integers
The Time Complexity of the Token Swapping Problem and Its Parallel Variants
Partitioning Graphs of Supply and Demand
WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24-26, 2022, Proceedings
Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression
WALCOM: Algorithms and Computation - 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceedings
Computing Nice Projections of Convex Polyhedra
Short Flip Sequences to Untangle Segments in the Plane
Fast Multiple Pattern Cartesian Tree Matching
Parallel Algorithms for Encoding and Decoding Blob Code
Abelian and Stochastic Sandpile Models on Complete Bipartite Graphs
Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph
The Bike Sharing Problem
Optimal Algorithms for Detecting Network Stability
Efficient Algorithm for Box Folding
Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
Boosting over Non-deterministic ZDDs
On a Class of Covering Problems with Variable Capacities in Wireless Networks
Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices
On the Complexity of List H-Packing for Sparse Graph Classes
Improved Approximation Algorithms for Cycle and Path Packings
Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest
The Connected k-Vertex One-Center Problem on Graphs
Black Hole Search in Dynamic Cactus Graph
Canonization of a Random Circulant Graph by Counting Walks
Machine Learning Advised Ski Rental Problem with a Discount
StreamTable: An Area Proportional Visualization for Tables with Flowing Streams
Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals
Superset Generation on Decision Diagrams
The Happy End Theorem and Related Results
Optimal Online Algorithms for the Multi-objective Time Series Search Problem
Analyzing the Quantum Annealing Approach for Solving Linear Least Squares Problems
Harmonious Coloring on Subclasses of Colinear Graphs
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions
On Certain New Models for Paging with Locality of Reference
On Graceful Labelings of Trees - (Extended Abstract)
An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances
Straight-Path Queries in Trajectory Data
How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments
Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs
A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow
Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path Metrics
A Novel Efficient Approach for Solving the Art Gallery Problem
A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs
A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs
Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
Minimum-Width Square Annulus Intersecting Polygons
On Bar (1, j)-Visibility Graphs - (Extended Abstract)
Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio
On the Hardness of Point-Set Embeddability - (Extended Abstract)
Structural Parameterizations of Vertex Integrity
Complexity Measures for Mosaic Drawings
Generalized Above Guarantee Vertex Cover and r-Partization
An Improved Algorithm for Parameterized Edge Dominating Set Problem
Flat-Foldability for 1 × n Maps with Square/Diagonal Grid Patterns
Cyclic Shift Problems on Graphs
Online Facility Assignment
Quantum Graph Drawing
A Width Parameter Useful for Chordal and Co-comparability Graphs
The Complexity of (List) Edge-Coloring Reconfiguration Problem
A Competitive Strategy for Distance-Aware Online Shape Allocation
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
Angle Covers: Algorithms and Complexity
Matching Random Colored Points with Rectangles
Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian Relaxation Approach
The Complexity of L(p, q)-Edge-Labelling
On Directed Tree Realizations of Degree Sets
An Optimal Tester for k-Linear
Range-Aggregate Queries Involving Geometric Aggregation Operations
The ${\mathcal{G}}$ -Packing with t-Overlap Problem
Recent Progresses in the Combinatorial and Algorithmic Study of Rooted Phylogenetic Networks
Approximability of Stable Matching Problems
A Note on Online Colouring Problems in Overlap Graphs and Their Complements
Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems
Minimum Face-Spanning Subgraphs of Plane Graphs
Multilevel Bandwidth and Radio Labelings of Graphs
Upward Drawings of Trees on the Minimum Number of Layers
A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs
Cover Ratio of Absolute Neighbor
Upward Point Set Embeddings of Paths and Trees
On Some $\mathcal{NP}$ -complete SEFE Problems
WALCOM: Algorithms and Computation, 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013. Proceedings
The Disjoint Paths Problem: Algorithm and Structure
Unit Covering in Color-Spanning Set Model
Enumerating Eulerian Trails via Hamiltonian Path Enumeration
1-Complex s, t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids
Parameterized Complexity of Minimum Membership Dominating Set
Isomorphism Testing for T-graphs in FPT
(t, s)-Completely Independent Spanning Trees
Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width
On Relaxing the Constraints in Pairwise Compatibility Graphs
Recent Research Activities on Algorithmic Foundations for Social Advancement
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost
r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes
Dag-Like Unit Refutations in UTVPI Constraint Systems
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid
Fast Optimal Labelings for Rotating Maps
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs
Maximum Neighbour Voronoi Games
A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips
Generalized Class Cover Problem with Axis-Parallel Strips
Computing a Minimum-Width Square Annulus in Arbitrary Orientation - [Extended Abstract]
Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs
Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas
Parameterized Complexity of (d, r)-Domination via Modular Decomposition
Recognition and Isomorphism of Proper $\boldsymbol{H}$-Graphs for Unicyclic $\boldsymbol{H}$ in FPT-Time
Routing in Histograms
Physical Zero-Knowledge Proof for Ripple Effect
Competitive Analysis for Multi-objective Online Algorithms
On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity
Fault-Tolerant Complete Visibility for Asynchronous Robots with Lights Under One-Axis Agreement
Efficient Algorithms for Sorting k-Sets in Bins
Roman k-Domination: Hardness, Approximation and Parameterized Results
WALCOM: Algorithms and Computation - 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28 - March 2, 2025, Proceedings
Parameterized Complexity of Path Set Packing
Parity Permutation Pattern Matching
On MAX-SAT with Cardinality Constraint
A Unified Model of Congestion Games with Priorities - Two-Sided Markets with Ties, Finite and Non-affine Delay Functions, and Pure Nash Equilibria
Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems
Four-Connected Spanning Subgraphs of Doughnut Graphs
Matched Drawability of Graph Pairs and of Graph Triples
On the Parallel Parameterized Complexity of the Graph Isomorphism Problem
Non-repetitive Strings over Alphabet Lists
Minimum t-Spanners on Subcubic Graphs
Train Scheduling: Hardness and Algorithms
Random Generation and Enumeration of Proper Interval Graphs
Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis
Packing 2D Disks into a 3D Container
A New Data Structure for Heapsort with Improved Number of Comparisons
Clustering with Internal Connectedness
Approximating the Bundled Crossing Number
On Triangle Cover Contact Graphs
Efficient Generation of a Card-Based Uniformly Distributed Random Derangement
FPT Algorithms for Connected Feedback Vertex Set
WALCOM: Algorithms and Computation - 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023, Proceedings
Circular Graph Drawings with Large Crossing Angles
Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis
Mixing Times of Markov Chains of 2-Orientations
On Dilworth k Graphs and Their Pairwise Compatibility
Listing All Plane Graphs
Compact Data Structures for Dedekind Groups and Finite Rings
Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard
On the Geometric Red-Blue Set Cover Problem
Computing beta -Drawings of 2-Outerplane Graphs in Linear Time
Boundary Labeling with Flexible Label Positions
Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs
Optimal Partition of a Tree with Social Distance
The Upper Bound on the Eulerian Recurrent Lengths of Complete Graphs Obtained by an IP Solver
On Graphs That Are Not PCGs
Approximation Schemes for Covering and Packing
Shortest Gently Descending Paths
Cutting a Convex Polyhedron Out of a Sphere
Shape Matching by Random Sampling
Edge-Colorings of Weighted Graphs - (Extended Abstract)
Time-Space Trade-Off for Finding the k -Visibility Region of a Point in a Polygon
Multilevel Planarity
Approximation Algorithm for Sorting by Reversals and Transpositions
Minimum Ply Covering of Points with Unit Squares
Efficient Generation of Top-k Procurements in a Multi-item Auction
Reasons to Fall (More) in Love with Combinatorial Reconfiguration
Faster Multi-sided One-Bend Boundary Labelling
Finding Geometric Representations of Apex Graphs is NP-Hard
Finding Triangles for Maximum Planar Subgraphs
On Minimum Average Stretch Spanning Trees in Polygonal 2-Trees
Optimal Uniform Shortest Path Sampling
Minimum Membership Covering and Hitting
Drawing Planar Graphs
Semimetric Properties of Sørensen-Dice and Tversky Indexes
Methods for Searching Mutual Visible-Intervals on Moving Object
Minmax Tree Cover in the Euclidean Space
Packing and Covering with Segments
Towards Work-Efficient Parallel Parameterized Algorithms
Flipping Plane Spanning Paths
A Compact Encoding of Plane Triangulations with Efficient Query Supports
On Some Simple Widths
On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
Fast Algorithms for Constrained Graph Density Problems
Reverse Shortest Path Problem in Weighted Unit-Disk Graphs
Mathematical Characterizations and Computational Complexity of Anti-slide Puzzles
Matching Sets of Line Segments
Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms
Two New Schemes in the Bitprobe Model
Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle
Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet - (Extended Abstract)
Greedy Consensus Tree and Maximum Greedy Consensus Tree Problems
The Cyclical Scheduling Problem
Minimizing Corners in Colored Rectilinear Grids
(k, p)-Planarity: A Relaxation of Hybrid Planarity
Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments
Shortest Covers of All Cyclic Shifts of a String
Compact Encodings and Indexes for the Nearest Larger Neighbor Problem
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
Lower Bounds for Graph Exploration Using Local Policies
Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem
Drawing Unordered Trees on k-Grids
Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods
Inferring Strings from Position Heaps in Linear Time
The Directed Ring Loading with Penalty Cost
An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths
On the Maximum Edge-Pair Embedding Bipartite Matching
Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult
Splitting Plane Graphs to Outerplanarity
Object Caching for Queries and Updates
Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules
An Efficient Implementation of Cosine Distance on Minimal Absent Word Sets Using Suffix Automata
DiskTrie: An Efficient Data Structure using Flash Memory for Mobile Devices
Dichotomies for Tree Minor Containment with Structural Parameters
Colinear Coloring on Graphs
Distribution of Distinguishable Objects to Bins: Generating All Distributions
Homomorphisms to Digraphs with Large Girth and Oriented Colorings of Minimal Series-Parallel Digraphs
Heuristics for the Maximum 2-layer RAC Subgraph Problem
Mobility and Computations: Some Open Research Directions
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs
Simple Geometrical Intersection Graphs
Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k -Planar Graphs
Some Results on Point Visibility Graphs
Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover
The Physarum Computer