-
Article
Pancreas-sparing partial duodenectomy as an alternative to emergency pancreaticoduodenectomy for a major duodenal perforation: a case report
A 71-year-old woman underwent endoscopic submucosal dissection for early duodenal cancer at the second portion of the duodenum and developed acute peritonitis due to delayed duodenal perforation. Emergency lap...
-
Article
Modified Intestinal Derotation Procedure with Reversed Kocherization to Facilitate Mesopancreas Excision During Pancreaticoduodenectomy
Although intestinal derotation procedure has advantages of facilitating mesopancreas excision during pancreaticoduodenectomy, the wide mobilization takes time and risks injuring other organs. This article desc...
-
Article
Lengthened Efferent Limb in Braun Enteroenterostomy Reduces Delayed Gastric Emptying After Pancreaticoduodenectomy
Delayed gastric emptying (DGE) is a common complication after pancreaticoduodenectomy (PD), but a method to prevent DGE has not been established. This study aims to demonstrate a novel technique utilizing a le...
-
Article
Open AccessLong-term survival after pancreatic metastasis resection from breast cancer: a systematic literature review
Patients with advanced-stage breast cancer often demonstrate pancreatic metastases. However, pancreatic metastases resection from breast cancer has been rarely performed, with only 20 cases having been reporte...
-
Article
Satisfiability Algorithm for Syntactic Read-k-times Branching Programs
The satisfiability of a given branching program is to determine whether there exists a consistent path from the root to 1-sink. In a syntactic read-k-times branching program, each variable appears at most k times...
-
Chapter and Conference Paper
Light Cryptography
Physical cryptography provides cryptographic protocols using physical objects like cards and envelopes instead of using computers
-
Article
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability
We present a satisfiability algorithm for k-indexed binary decision diagrams (k-IBDDs). The proposed exponential space and deterministic algorithm solves the satisfiability of k-IBDDs, i.e., k-IBDD SAT, for insta...
-
Article
Clinical evaluation of the aberrant left hepatic artery arising from the left gastric artery in esophagectomy
The left gastric artery (LGA) is commonly severed when the gastric tube is made for esophageal reconstruction. Sacrifice of the LGA can cause liver ischemic necrosis in patients with an aberrant left hepatic a...
-
Article
Open AccessTwo-stage hepatectomy aiming for the development of intrahepatic venous collaterals for multiple colorectal liver metastases
Aggressive hepatectomy with venous resection has a higher risk of postoperative liver failure (POLF) than hepatectomy without venous reconstruction; however, venous reconstruction is technically demanding. We ...
-
Chapter and Conference Paper
Physical Zero-Knowledge Proof for Makaro
Makaro is a logic game similar to Sudoku. In Makaro, a grid has to be filled with numbers such that: given areas contain all the numbers up to the number of cells in the area, no adjacent numbers are equal and...
-
Chapter and Conference Paper
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
We present improvements to a branch-and-bound maximum-clique-finding algorithm MCS (WALCOM 2010, LNCS 5942, pp. 191–203) that was shown to be fast. First, we employ an efficient approximation algorithm for fin...
-
Chapter and Conference Paper
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability
A k-indexed Binary Decision Diagram (k-IBDD) is a branching program with k-layers and each layer consists of an Ordered Binary Decision Diagram (OBDD). This paper studies the satisfiability of k-IBDD (k-IBDD SAT)...
-
Chapter and Conference Paper
Efficient Algorithms for Sorting k-Sets in Bins
We give efficient algorithms for Sorting k-Sets in Bins. The Sorting k-Sets in Bins problem can be described as follows: We are given numbered n bins with k balls in each bin. Balls in the i-th bin are numbered n
