首页>外文会议>International workshop on algorithms and computation

International workshop on algorithms and computation

召开年：
召开地：
出版时间：-

会议文集：-

会议论文

热门论文

全部论文

全选（0）

1.Preface

机译：前言
- 作者：M. Sohel Rahman;Wing-Kin Sung;Ryuhei Uehara
- 会议名称：《International workshop on algorithms and computation》 | 2018年
2.Optimal Sink Location Problems on Dynamic Flow Networks

机译：动态流网络上的最优水槽位置问题
- 作者：Naoki Katoh
- 会议名称：《International workshop on algorithms and computation》 | 2018年
- Disaster prevention;
- Disaster management;
- Evacuation;
- k-center problem;
- k-median problems;
- Facility location;
- Multi-commodity dynamic flow problem;
3.Logic in Computational Biology

机译：计算生物学逻辑
- 作者：Limsoon Wong
- 会议名称：《International workshop on algorithms and computation》 | 2018年
- Computational biology;
- Logical inference from invariants;
- Violation of invariants;
- Guilt by association;
4.Morphing Planar Graph Drawings

机译：变形平面图
- 作者：Giuseppe Di Battista
- 会议名称：《International workshop on algorithms and computation》 | 2018年
5.A Simple Algorithm for r-gatherings on the Line

机译：在线r聚集的简单算法
- 作者：Shin-ichi Nakano
- 会议名称：《International workshop on algorithms and computation》 | 2018年
- Algorithm;
- Facility location;
- Gathering;
6.Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs

机译：非同构区间图和非同构排列图的枚举
- 作者：Kazuaki Yamazaki;Toshiki Saitoh;Masashi Kiyomi;Ryuhei Uehara
- 会议名称：《International workshop on algorithms and computation》 | 2018年
7.Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph

机译：一致泄漏的密钥交换完成图上的秘密密钥放大
- 作者：Tatsuya Sasaki;Bateh Mathias Agbor;Shingo Masuda;Yu-ichi Hayashi;Takaaki Mizuki;Hideaki Sone
- 会议名称：《International workshop on algorithms and computation》 | 2018年
- Key exchange graph;
- st-numbering;
- Key agreement protocol;
- Privacy amplification;
- Network reliability problem;
8.Approximating Partially Bounded Degree Deletion on Directed Graphs

机译：有向图的局部有界度逼近
- 作者：Toshihiro Fujito;Kei Kimura;Yuki Mizuno
- 会议名称：《International workshop on algorithms and computation》 | 2018年
- Approximation algorithms;
- Bounded Degree Deletion;
- Partial cover;
9.Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases

机译：具有异常值的最小宽度环：圆形，正方形和矩形例
- 作者：Hee-Kap Ahn;Taehoon Ahn;Sang Won Bae;Jongmin Choi;Mincheol Kim;Eunjin Oh;Chan-Su Shin;Sang Duk Yoon
- 会议名称：《International workshop on algorithms and computation》 | 2018年
10.Minimum-Width Square Annulus Intersecting Polygons

机译：最小宽度正方形环相交多边形
- 作者：Hee-Kap Ahn;Taehoon Ahn;Jongmin Choi;Mincheol Kim;Eunjin Oh
- 会议名称：《International workshop on algorithms and computation》 | 2018年
11.Two New Schemes in the Bitprobe Model

机译：Bitprobe模型中的两个新方案
- 作者：Mirza Galib Anwarul Husain Baig;Deepanjan Kesh
- 会议名称：《International workshop on algorithms and computation》 | 2018年
12.Faster Network Algorithms Based on Graph Decomposition

机译：基于图分解的快速网络算法
- 作者：Manas Jyoti Kashyop;Tsunehiko Nagayama;Kunihiko Sadakane
- 会议名称：《International workshop on algorithms and computation》 | 2018年
13.An Improvement of the Algorithm of Hertli for the Unique 3SAT Problem

机译：唯一3SAT问题Hertli算法的改进
- 作者：Tong Qin;Osamu Watanabe
- 会议名称：《International workshop on algorithms and computation》 | 2018年
14.Random Popular Matchings with Incomplete Preference Lists

机译：具有不完整偏好列表的随机流行匹配
- 作者：Suthee Ruangwises;Toshiya Itoh
- 会议名称：《International workshop on algorithms and computation》 | 2018年
- Popular matching;
- Incomplete preference lists;
- Phase transition;
- Complex component;
15.Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian Relaxation Approach

机译：在具有工作依赖缓冲区要求的灵活Flowshop中调度批处理：拉格朗日松弛法
- 作者：Hanyu Gu;Julia Memar;Yakov Zinder
- 会议名称：《International workshop on algorithms and computation》 | 2018年
- Scheduling;
- Flexible flowshop;
- Weighted total tardiness;
- Limited buffer;
- Lagrangian relaxation;
16.Computing Periods...

机译：计算期间...
- 作者：Junhee Cho;Sewon Park;Martin Ziegler
- 会议名称：《International workshop on algorithms and computation》 | 2018年
- Exact Real Computation;
- Reliable numerics;
- Computational algebraic geometry;
- Randomized algorithms;
17.A Note on Online Colouring Problems in Overlap Graphs and Their Complements

机译：关于重叠图中的在线着色问题及其补充的注记
- 作者：Marc Demange;Martin Olsen
- 会议名称：《International workshop on algorithms and computation》 | 2018年
18.Online Facility Assignment

机译：在线设施分配
- 作者：Abu Reyan Ahmed;Md. Saidur Rahman;Stephen Kobourov
- 会议名称：《International workshop on algorithms and computation》 | 2018年
19.Fault-Tolerant Complete Visibility for Asynchronous Robots with Lights Under One-Axis Agreement

机译：一轴协议下带灯光的异步机器人的容错完整可见性
- 作者：Aisha Aljohani;Pavan Poudel;Gokarna Sharma
- 会议名称：《International workshop on algorithms and computation》 | 2018年
20.A Simple, Fast, Filter-Based Algorithm for Circular Sequence Comparison

机译：一种简单，快速，基于滤波器的循环序列比较算法
- 作者：Md. Aashikur Rahman Azim;Mohimenul Kabir;M. Sohel Rahman
- 会议名称：《International workshop on algorithms and computation》 | 2018年
21.Boosting over Non-deterministic ZDDs

机译：提高不确定性ZDD
- 作者：Takahiro Fujita;Kohei Hatano;Eiji Takimoto
- 会议名称：《International workshop on algorithms and computation》 | 2018年
22.On Multiple Longest Common Subsequence and Common Motifs with Gaps (Extended Abstract)

机译：关于多个最长的公共子序列和具有缺口的公共图案（扩展摘要）
- 作者：Suri Dipannita Sayeed;M. Sohel Rahman;Atif Rahman
- 会议名称：《International workshop on algorithms and computation》 | 2018年
- Computational biology;
- Motif finding;
- Complexity;
- Branch and bound;
23.FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type Models

机译：利用FPT算法对欧拉定向和冰型模型进行雕刻分解
- 作者：Shinya Shiroshita;Tomoaki Ogasawara;Hidefumi Hiraishi;Hiroshi Imai
- 会议名称：《International workshop on algorithms and computation》 | 2018年
24.On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity

机译：关于快乐着色，帝国着色和适应性的结构参数化
- 作者：Jayesh Choudhari;I. Vinod Reddy
- 会议名称：《International workshop on algorithms and computation》 | 2018年
- Parameterized complexity;
- Threshold graphs;
- Algorithm;
25.Complexity of the Maximum k-Path Vertex Cover Problem

机译：最大k路径顶点覆盖问题的复杂性
- 作者：Eiji Miyano;Toshiki Saitoh;Ryuhei Uehara;Tsuyoshi Yagita;Tom C. van der Zanden
- 会议名称：《International workshop on algorithms and computation》 | 2018年
26.On the Parallel Parameterized Complexity of the Graph Isomorphism Problem

机译：图同构问题的并行参数化复杂度
- 作者：Bireswar Das;Murali Krishna Enduri;I. Vinod Reddy
- 会议名称：《International workshop on algorithms and computation》 | 2018年