yusuke1997/dblp-id-title huggingface dataset:
The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract)
Linear Precedence Parsing for a New Class of Graph Grammars
On the b-Chromatic Number of Graphs
Approximating Infeasible 2VPI-Systems
Disjoint Paths in the Hypercube
Automatic Crystal Chemical Classification of Silicates Using Direction-Labeled Graphs
Bus Routing Problems on Acyclic Networks
The Complexity of Constructing Quad-Trees in Arbitrary Dimensions
Recognizing Graphs without Asteroidal Triples
An Improved Algorithm for Finding Tree Decompositions of Small Width
On-Line Algorithms for Networks of Temporal Constraints
Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs
How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers
Petri Nets, Hypergraphs and Conflicts (Preliminary Version)
The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes
Voronoi Diagrams in the Moscow Metric (Extended Abstract)
Fixed-Parameter Tractability and Characterizations of Small Special Treewidth
On the Pseudo-achromatic Number Problem
Completely Connected Clustered Graphs
On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracy
Generating All the Minimal Separators of a Graph
Algorithmic Barriers from Phase Transitions in Graphs
On Claw-Free Asteroidal Triple-Free Graphs
Parameterized Two-Player Nash Equilibrium
Colouring of Graphs with Ramsey-Type Forbidden Subgraphs
Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings
The Vertex-Disjoint Triangles Problem
Basic Graphtheoretical Structures for Multi Processor Concepts
A Graph-Theoretical Model for Multi-Pass Parsing
Voronoi Diagrams of Moving Points in the Plane
On the Minimum Size of a Contraction-Universal Tree
Hot-Potato Routing on Multi-Dimensional Tori
What Is between Chordal and Weakly Chordal Graphs?
On Perfect Linegraph Squares
A Travelling Salesman Problem with Additional Constraints
Priority Search Trees in Secondary Memory (Extended Abstract)
Searching Is Not Jumping
Block Elimination Distance
A New Intersection Model and Improved Algorithms for Tolerance Graphs
Parameterized Complexity of Eulerian Deletion Problems
Linear Kernels in Linear Time, or How to Save k Colors in O(n 2 ) Steps
Matching, Edge-Colouring, and Dimers
Connecting Terminals and 2-Disjoint Connected Subgraphs
Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers
Strip Graphs: Recognition and Scheduling
Flip Distances Between Graph Orientations
Divide-and-Color
Fault Tolerant Networks of Specified Diameter
Sub-coloring and Hypo-coloring Interval Graphs
Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs
Counting Independent Sets in Claw-Free Graphs
Maximum Independent Sets in Subcubic Graphs: New Results
Minimum Rectilinear Steiner Tree for Intervals on two Parallel Lines
Algorithmic Aspects of Small Quasi-Kernels
Time Bound for Broadcasting in Bounded Degree Graphs
Finding Shortest Paths in Very Large Networks
Tight Bounds for the Rectangualr Art Gallery Problem
Universal Geometric Graphs
Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)
Treelike Comparability Graphs: Characterization, Recognition, and Applications
The Normal Graph Conjecture for Classes of Sparse Graphs
Algorithms and Hardness for Metric Dimension on Digraphs
Chordal Deletion Is Fixed-Parameter Tractable
Serializable Graphs
Optimal General Matchings
Clique Graph Recognition Is NP-Complete
Near-Optimal Dominating Sets in Dense Random Graphs in Polynomial Expected Time
On Edge Intersection Graphs of Paths with 2 Bends
LexBFS-Orderings and Power of Graphs
Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality
Graphs and Graph Polynomials of interest in Chemistry
F-Factors, Perfect Matchings and Related Concepts
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs
Chordal Digraphs
Compact Implicit Representation of Graphs
Interally Typed Second-Order Term Graphs
On the Complexity of Some Coloring Games
Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition
The Separation Problem
Weighted Efficient Domination for P_6 -Free and for P_5 -Free Graphs
O(n²) Algorithms for Graph Planarization
Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses
On Fully Diverse Sets of Geometric Objects and Graphs
Minimum Spanning Tree Verification Under Uncertainty
DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem
Approximating the Traffic Grooming Problem in Tree and Star Networks
A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs
Linear Rank-Width of Distance-Hereditary Graphs
Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases
A Relational View on Gotos and Dynamic Logic
s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs
On Shortcutting Digraphs
Characterization and Linear-Time Recognition of Paired Threshold Graphs
On Computing an Optimal Semi-matching
The Dynamic Complexity of Acyclic Hypergraph Homomorphisms
Network Exploration by Silent and Oblivious Robots
The Rank-Width of the Square Grid
Extension Complexity of Stable Set Polytopes of Bipartite Graphs
NC-Algorithms for Graphs with Small Treewidth
A Linear Time Algorithm for Isomorphism of Graphs of Bounded Average Genus
Greedy Triangulation acn be Efficiently Implemented in the Average Case (Extended Abstract)
Fully Dynamic Maintenance of Vertex Cover
Monadic Second-Order Evaluations on Tree-Decomposable Graphs
Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem
Minimizing NLC-Width is NP-Complete
A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL
Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size
Edge Separators for Graphs of Bounded Genus with Applications
WEighted Parallel Triangulation of Simple Polygons
On the Independence Number of Graphs with Maximum Degree 3
On Independent Sets and Bicliques in Graphs
Computing Subset Transversals in H-Free Graphs
Graph-Theoretic Concepts in Computer Science, 14th International Workshop, WG '88, Amsterdam, The Netherlands, June 15-17, 1988, Proceedings
The Graphs of Stably Matchable Pairs
On the Monotonicity of Games Generated by Symmetric Submodular Functions
Independent Set Reconfiguration Parameterized by Modular-Width
On the Hardness of Recognizing Bundles in Time Table Graphs
Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders
Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs
On Chaotic Behaviour of Some NP-Complete Problems
Embedding Complete Binary Trees in Product Graphs
Approximately Coloring Graphs Without Long Induced Paths
On Concurrency Control in Shared B-Trees
Induced Disjoint Paths in Circular-Arc Graphs in Linear Time
Characterization and Recognition of Generalized Clique-Helly Graphs
The Complexity of Restrictive H-Coloring
Planar k-Path in Subexponential Time and Polynomial Space
A Framework for Data Structures
Complexity Results for the Spanning Tree Congestion Problem
The Bandwidth of Planar Distributive Lattices
Intersection Graphs of Non-crossing Paths
Exact and Parameterized Algorithms for Max Internal Spanning Tree
Characterising AT-free Graphs with BFS
On Distance-d Independent Set and Other Problems in Graphs with "few" Minimal Separators
Proportionally Fair Matching with Multiple Groups
A Parameterized Complexity Analysis of Bounded Height Depth-First Search Trees
Untangling a Travelling Salesman Tour in the Plane
Minimum-Weight Cycle Covers and Their Approximability
Approximating Branchwidth on Parametric Extensions of Planarity
Vertex Cover: Further Observations and Further Improvements
Independent Spanning Trees of Product Graphs
Efficient Algorithms for the Constraint Generation for Integrated Circuit Layout Compaction
Towards the Hanani-Tutte Theorem for Clustered Graphs
Intersection Graphs of Rays and Grounded Segments
Avoiding Matrix Multiplication
Constant Time Generation of Trees with Specified Diameter
An Interactive Graphical Manipulation System for Higher Order Objects Based on Relational Algebra
Optimal Solutions for Frequency Assignment Problems via Tree Decomposition
Many Views of Planar Point Sets
Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
Optimal Cuts for Powers of the Petersen Graph
Coloring Mixed Hypertrees
On the Number of Minimal Separators in Graphs
(g, f)-Factorizations Orthogonal to k Subgraphs
On Interval Routing Schemes and Treewidth
Recognizing Hyperelliptic Graphs in Polynomial Time
Fault-Tolerant Interconnection Networks: A Graph-Theoretic Approach
Complexity Classification of Some Edge Modification Problems
Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers
A Structural Text Editor Based on Graph Grammars
Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract)
Channel Assignment and Improper Choosability of Graphs
Bounds on the quality of approximate solutions to the Group Steiner Problem
Ultimate Generalizations of LexBFS and LEX M
Broadcasting on Anonymous Unoriented Tori
Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques
Generating Faster Algorithms for d-Path Vertex Cover
On Strongly Chordal Graphs That Are Not Leaf Powers
Induced Matchings in Regular Graphs and Trees
Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes
Equiangular Polygon Contact Representations
Optimal Area Algorithm for Planar Polyline Drawings
Complexity and Approximation Results for the Connected Vertex Cover Problem
Cops and Robbers on Multi-Layer Graphs
Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers
Minimal de Bruijn Sequence in a Language with Forbidden Substrings
Degreewidth on Semi-complete Digraphs
Modular Decomposition of Hypergraphs
On Flips in Planar Matchings
Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications
Attributed Elementary Programmed Graph Grammars
Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs
Networks with Small Stretch Number
Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2
Communication in the Two-Way Listen-in Vertex-disjoint Paths Mode
A Simple Test for Interval Graphs
The Monadic Second-Order Logic of Graphs: Definable Sets of Finite Graphs
Graphs, Hypergraphs and Hashing
Minimal Elimination Ordering Inside a Given Chordal Graph
A Compact Data Structure and Parallel Algorithms for Permutation Graphs
A Parser for Context Free Plex Grammars
Minimal Proper Interval Completions
Proximity-Preserving Labeling Schemes and Their Applications
Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages
Graphen, Algorithmen, Datenstrukturen, Proceedings WG '76, Graphtheoretic Concepts in Computer Science, Göttingen, Germany
Specification of Graph Translators with Triple Graph Grammars
The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms
The Size of Reduced OBDDs and Optimal Read-once Branching Programs for Almost all Boolean Functions
The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings
Cycles in Generalized Networks
An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes
Invited Lecture: Discrete Optimization Methods for Packing Problems in Two and Three Dimensions - With Applications in the Textile and Car Manufacturing Industries
Counting Edges in a Dag
Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey
On-Line Algorithms for Shortest Path Problems on Planar Digraphs
Open Problems on Graph Coloring for Special Graph Classes
Modifications of the Logical Structure of 3NF-Relational Databases
Equilateral L-Contact Graphs
The Clique-Width of Tree-Power and Leaf-Power Graphs
Finding Minimally Weighted Subgraphs
Generalized H-Coloring and H-Covering of Trees
Finding Extreme Distances between Convex Polygons
Exhaustive Generation of k-Critical ℋ-Free Graphs
A Birds Eye View to Path Problems
P -Matchings Parameterized by Treewidth
The Tree-Width of Clique-Width Bounded Graphs Without K n, n
Maximal Induced Matchings in Triangle-Free Graphs
On Integration Mechanisms within a Graph-based Software Development Environment
Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal
Hexagonal Grid Drawings
An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minor
Connected Feedback Vertex Set in Planar Graphs
K Best Cuts in Planar and Nonplanar Networks
A Slice Theoretic Approach for Embedding Problems on Digraphs
Bypass Strong V-Structures and Find an Isomorphic Labelled Subgraph in Linear Time
Tree-Width and Optimization in Bounded Degree Graphs
A Simple Linear -TIme Algorithm to Recognize Interval Graphs
Injective Oriented Colourings
On-line Graph Algorithms for Incremental Compilation
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts
Introduction to PROGRESS, an Attribute Graph Grammar Based Specification Language
Generalized Graph Clustering: Recognizing ( p , q )-Cluster Graphs
Labelled Trees and Pairs of Input-Output Permutations in Priority Queues
New Spectral Lower Bounds on the Bisection Width of Graphs
The Complexity of Broadcasting in Planar and Decomposable Graphs
Realizing Temporal Transportation Trees
The Complexity of Gerrymandering over Graphs: Paths and Trees
Recognizing Bipartite Tolerance Graphs in Linear Time
Iterative Algorithms on Grammar Graphs
Block Decomposition of Inheritance Hierarchies
Zufallsgraphen
Colouring Perfect Planar Graphs in Parallel
Evaluations of Graph Polynomials
List Coloring in the Absence of a Linear Forest
Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs
On Searching for Small Kochen-Specker Vector Systems
Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts
Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), Linz, Austria, June 15-17, 1981
Granularity of Memory in Parallel Computation
Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths
On the Parameterized Complexity of Computing Graph Bisections
A New Width Parameter of Graphs Based on Edge Cuts: α-Edge-Crossing Width
A Graph-Based Decomposition Approach for Recursive Query Processing
The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results
Specification of Error Distances for Graphs by Precedence Graph Grammars and Fast Recognition of Similarity
Weighted Additive Spanners
Feedback Vertex Set for Pseudo-disk Graphs in Subexponential FPT Time
Routing Permutations in the Hypercube
Update Networks and Their Routing Strategies
Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph
On the Recognition of P 4 -Comparability Graphs
More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree
Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs
The Complexity of the Matching-Cut Problem
A Simple Linear Time LexBFS Cograph Recognition Algorithm
The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small
Triangulating Planar Graphs While Keeping the Pathwidth Small
Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth
Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs
A Lower Bound on the Area Requirements of Series-Parallel Graphs
Coloring a Graph Using Split Decomposition
Prefix Graphs and Their Applications
Measuring the Distance to Series-Parallelity by Path Expressions
Popular Solutions for Optimal Matchings
On Hyperedge Replacement and BNLC Graph Grammars
Designing Gamma-Acyclic Database Schemes Using Decomposition and Augmentation Techniques
NLC 2 -Decomposition in Polynomial Time
Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard
The Parallel Complexity of Elimination Ordering Procedures
Parameterized Complexity of Broadcasting in Graphs
Bimodular Decomposition of Bipartite Graphs
Asteroidal Triple-Free Graphs
Decremental Clique Problem
Drawing Graphs with Few Arcs
Graph-Theoretic Concepts in Computer Science, 16rd International Workshop, WG '90, Berlin, Germany, June 20-22, 1990, Proceedings
Roman Domination over Some Graph Classes
The Use of Transitively Irreducible Kernels of Full Families of Functional Dependencies in Logical Data Base Design
Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3
Simultaneous Graph Embeddings with Fixed Edges
Minus Domination in Small-Degree Graphs
A Rainbow About T-Colorings for Complete Graphs
Problems Hard for Treewidth but Easy for Stable Gonality
On the Recognition of k-Equistable Graphs
Interval Completion with the Smallest Max-degree
(Time × Space)-Efficient Implementations of Hierarchical Conceptual Models
Parameterized Algorithms for Graph Partitioning Problems
Convexity-Increasing Morphs of Planar Graphs
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem
Searching Connected Components in Very Large Grid Graphs
Homogeneously Orderable Graphs and the Steiner Tree Problem
Direct Path Graph Isomorphism (Extended Abstract)
On Assembly of Four-Connected Graphs (Extended Abstract)
Drawing Planar Graphs on a Curve
Maximum Clique Transversals
h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area
Generating All Planar 0-, 1-, 2-, 3-Connected Graphs
Mod-2 Independence and Domination in Graphs
Generating Colored Trees
An O (n^2) Time Algorithm for the Minimal Permutation Completion Problem
On the Tree Search Problem with Non-uniform Costs
VC-Dimensions for Graphs (Extended Abstract)
Optimal Hypergraph Tree-Realization
Knot Diagrams of Treewidth Two
Efficient Analysis of Graphs with Small Minimal Separators
Concurrency of Node-Label-Controlled Graph Transformations
On the Complexity of the Membership Problem of Graph Grammars
XNLP-Hardness of Parameterized Problems on Planar Graphs
Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers
Approximating the Chromatic Polynomial of a Graph
Performance of Index Structures for Databases
17th International Workshop, WG '91, Fischbachau, Germany, June 17-19, 1991, Proceedings
Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract)
Comparing the expressibility of two languages formed using NP-complete graph operators
Graphtheoretic Concepts in Computer Science, Proceedings WG '85, Castle Schwanberg (near Würzburg), Germany
On the Complexity of Computing the k-restricted Edge-connectivity of a Graph
On the Clique-Width of Perfect Graph Classes
DFS Tree Construction: Algorithms and Characterizations
An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph
Weak Unit Disk and Interval Representation of Graphs
Datenstrukturen, Graphen, Algorithmen, Proceedings WG '77, Linz, Austria
Baer's Weight Balanced Trees are almost Trees of Bounded Balance
New Lower Bounds and Hierarchy Results for Restricted Branching Programs
Exact Algorithms for Kayles
On Linearizing Graphs
Dually Chordal Graphs
Tree-Like Structures in Graphs: A Metric Point of View
(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective
On Optimal Graphs Embedded into Path and Rings, with Analysis Using l 1 -Spheres
PAVA: Privacy-Preserving Attribute-Based Verifiable Authentication in Healthcare using Smart Contracts
Bilateral Secure and Decentralized Crowdsourcing Task Matching Atop Consortium Blockchain
An Efficient Miner Strategy for Selecting Cryptocurrency Transactions
Regulatory Opportunities and Challenges for Blockchain Adoption for Circular Economies
Android-based Cryptocurrency Wallets: Attacks and Countermeasures
A Blockchain-enabled Anonymous-yet- Traceable Distributed Key Generation
Detect and Isolate an Adversary in Fakey and Griefing-R Attack on Lightning Network
Towards achieving confidentiality in Hyperledger Fabric
Blockchain and off-chain: A Solution for Audit Issues in Supply Chain Systems
Comparative Analysis of Permissioned Blockchains: Cosmos, Hyperledger Fabric, Quorum, and XRPL
Blockchain: the Paradox of Consumer Trust in a Trustless System - a Systematic Review
A Blockchain Using Proof-of-Download
Implicit Authentication in Neural Key Exchange Based on the Randomization of the Public Blockchain
Secure Distributed Network Model to Store Vehicle Transaction Records Through Blockchain Platform
EIoVChain: Towards Authentication and Secure Communication Based Blockchain for Internet of Vehicles (IoV)
State-based Invariant Property Generation of Solidity Smart Contracts using Abstract Interpretation
Decentralized Lightweight Detection of Eclipse Attacks on Bitcoin Clients
On Creation of a Stablecoin Based on the Morini's Scheme of Inv&Sav Wallets and Antimoney
EMIS: A Uniform Management and Resolution System of Multiple Identifiers on Ethereum
Fork Rate-Based Analysis of the Longest Chain Growth Time Interval of a PoW Blockchain
The Validator's Dilemma in PoW Blockchain: An Evolutionary Game Perspective
From Oracles to Trustworthy Data On-Chaining Systems
Decentralized Health Data Distribution: A DLT-based Architecture for Data Protection
A Distributed Clock Synchronization Protocol for Proof of Stake Blockchains
A Proxy-Layer Approach to Secure Smart Contract Deployment on Private EVM-Based PoA Blockchains
BeaconBlocks: Augmenting Proof-of-Stake with On-Chain Time Synchronization
An Edge Colouring-based Collaborative Routing Protocol for Blockchain Offline Channels
Blockchain-Based Real Estate Market: One Method for Applying Blockchain Technology in Commercial Real Estate Market
Blockchain Based e-Invoicing Platform for Global Trade
Slicing PBFT Consensus Algorithm Based on VRF
Group-Oriented Multi-Signature supporting Monotonic Endorse Policies in Hyperledger Fabric
Security Analysis of DeFi: Vulnerabilities, Attacks and Advances
SURE: A New Privacy and Utility Assessment Library for Synthetic Data
A Trusted Sharing Model for Risk Information of Food Full-process and All-information Based on Blockchain and Federated Learning
A Blockchain-Based Privacy-Preserving Auditable Data Structure Framework
A Voting-Based Blockchain Interoperability Oracle
The Philos Trust Algorithm: Preventing Exploitation of Distributed Trust
A State-Function-Driven Consensus Protocol for Blockchain Networks
LiftChain: A Scalable Multi-Stage NFT Transaction Protocol
Versioned Analysis of Software Quality Indicators and Self-admitted Technical Debt in Ethereum Smart Contracts with Ethstractor
Air Gapped Wallet Schemes and Private Key Leakage in Permissioned Blockchain Platforms
Micro-Accreditation for Matching Employer E-Hire Needs
The Ecological System of Digital Asset Markets: Based on the Perspective of Asset Trading and Valuation
On the Storage Overhead of Proof-of-Work Blockchains
IEEE International Conference on Blockchain, Blockchain 2024, Copenhagen, Denmark, August 19-22, 2024
A Reputation Management Framework for Knowledge-Based and Probabilistic Blockchains
ZKP Enabled Identity and Reputation Verification in P2P Marketplaces
BATS: A Blockchain-based Authentication and Trust Management System in Vehicular Networks
A Quality of Service Compliance System Empowered by Smart Contracts and Oracles
Formal Verification of Smart Contracts Using Interface Automata
IEEE International Conference on Blockchain, Blockchain 2022, Espoo, Finland, August 22-25, 2022
Analysis of Attack Activities for Honeypots Installation in Ethereum Network